# Primitive Type slice 1.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]

#### `fn len(&self) -> usize`

Returns the number of elements in the slice.

# Example

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

#### `fn is_empty(&self) -> bool`

Returns `true` if the slice has a length of 0.

# Example

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

#### `fn first(&self) -> Option<&T>`

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

#### `fn first_mut(&mut self) -> Option<&mut T>`

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

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

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

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

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

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

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

#### `fn last(&self) -> Option<&T>`

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

#### `fn last_mut(&mut self) -> Option<&mut T>`

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

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

Returns a reference to an element or subslice depending on the type of index.

- If given a position, returns a reference to the element at that position or `None` if out of bounds.
- If given a range, returns the subslice corresponding to that range, or `None` if out of bounds.

# Examples

    let v = [10, 40, 30];
    assert_eq!(Some(&40), v.get(1));
    assert_eq!(Some(&[10, 40][..]), v.get(0..2));
    assert_eq!(None, v.get(3));
    assert_eq!(None, v.get(0..4));Run

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

Returns a mutable reference to an element or subslice depending on the type of index (see `get`) or `None` if the index is out of bounds.

# Examples

    let x = &mut [0, 1, 2];

    if let Some(elem) = x.get_mut(1) {
        *elem = 42;
    }
    assert_eq!(x, &[0, 42, 2]);Run

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

Returns a reference to an element or subslice, without doing bounds checking.

This is generally not recommended, use with caution! For a safe alternative see `get`.

# Examples

    let x = &[1, 2, 4];

    unsafe {
        assert_eq!(x.get_unchecked(1), &2);
    }Run

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

Returns a mutable reference to an element or subslice, without doing bounds checking.

This is generally not recommended, use with caution! For a safe alternative see `get_mut`.

# Examples

    let x = &mut [1, 2, 4];

    unsafe {
        let elem = x.get_unchecked_mut(1);
        *elem = 13;
    }
    assert_eq!(x, &[1, 13, 4]);Run

#### `fn as_ptr(&self) -> *const T`

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

#### `fn as_mut_ptr(&mut self) -> *mut T`

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

#### `fn swap(&mut self, a: usize, b: usize)`

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

#### `fn reverse(&mut self)`

Reverses the order of elements in the slice, in place.

# Example

    let mut v = [1, 2, 3];
    v.reverse();
    assert!(v == [3, 2, 1]);Run

#### `fn iter(&self) -> Iter<T>`

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

#### `fn iter_mut(&mut self) -> IterMut<T>`

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

#### `fn windows(&self, size: usize) -> Windows<T>`

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

    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

#### `fn chunks(&self, size: usize) -> Chunks<T>`

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

    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

#### `fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>`

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

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

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 = [10, 40, 30, 20, 50];
    let (v1, v2) = v.split_at(2);
    assert_eq!([10, 40], v1);
    assert_eq!([30, 20, 50], v2);Run

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

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

#### `fn split<F>(&self, pred: F) -> Split<T, F> where
F: FnMut(&T) -> bool,`

Returns an iterator over subslices separated by elements that match `pred`. The matched element is not contained in the subslices.

# Examples

    let slice = [10, 40, 33, 20];
    let mut iter = slice.split(|num| num % 3 == 0);

    assert_eq!(iter.next().unwrap(), &[10, 40]);
    assert_eq!(iter.next().unwrap(), &[20]);
    assert!(iter.next().is_none());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

#### `fn split_mut<F>(&mut self, pred: F) -> SplitMut<T, F> where
F: FnMut(&T) -> bool,`

Returns an iterator over mutable subslices separated by elements that match `pred`. The matched element is not contained in the subslices.

# Examples

    let mut v = [10, 40, 30, 20, 60, 50];

    for group in v.split_mut(|num| *num % 3 == 0) {
        group[0] = 1;
    }
    assert_eq!(v, [1, 40, 30, 1, 60, 1]);Run

#### `fn rsplit<F>(&self, pred: F) -> RSplit<T, F> where
F: FnMut(&T) -> bool,`

🔬 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

#### `fn rsplit_mut<F>(&mut self, pred: F) -> RSplitMut<T, F> where
F: FnMut(&T) -> bool,`

🔬 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

#### `fn splitn<F>(&self, n: usize, pred: F) -> SplitN<T, F> where
F: FnMut(&T) -> bool,`

Returns an iterator over subslices separated by elements that match `pred`, limited to returning at most `n` items. The matched element is not contained in the subslices.

The last element returned, if any, will contain the remainder of the slice.

# Examples

Print the slice split once by numbers divisible by 3 (i.e. `[10, 40]`, `[20, 60, 50]`):

    let v = [10, 40, 30, 20, 60, 50];

    for group in v.splitn(2, |num| *num % 3 == 0) {
        println!("{:?}", group);
    }Run

#### `fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<T, F> where
F: FnMut(&T) -> bool,`

Returns an iterator over subslices separated by elements that match `pred`, limited to returning at most `n` items. The matched element is not contained in the subslices.

The last element returned, if any, will contain the remainder of the slice.

# Examples

    let mut v = [10, 40, 30, 20, 60, 50];

    for group in v.splitn_mut(2, |num| *num % 3 == 0) {
        group[0] = 1;
    }
    assert_eq!(v, [1, 40, 30, 1, 60, 50]);Run

#### `fn rsplitn<F>(&self, n: usize, pred: F) -> RSplitN<T, F> where
F: FnMut(&T) -> bool,`

Returns an iterator over subslices separated by elements that match `pred` limited to returning at most `n` items. This starts at the end of the slice and works backwards. The matched element is not contained in the subslices.

The last element returned, if any, will contain the remainder of the slice.

# Examples

Print the slice split once, starting from the end, by numbers divisible by 3 (i.e. `[50]`, `[10, 40, 30, 20]`):

    let v = [10, 40, 30, 20, 60, 50];

    for group in v.rsplitn(2, |num| *num % 3 == 0) {
        println!("{:?}", group);
    }Run

#### `fn rsplitn_mut<F>(&mut self, n: usize, pred: F) -> RSplitNMut<T, F> where
F: FnMut(&T) -> bool,`

Returns an iterator over subslices separated by elements that match `pred` limited to returning at most `n` items. This starts at the end of the slice and works backwards. The matched element is not contained in the subslices.

The last element returned, if any, will contain the remainder of the slice.

# Examples

    let mut s = [10, 40, 30, 20, 60, 50];

    for group in s.rsplitn_mut(2, |num| *num % 3 == 0) {
        group[0] = 1;
    }
    assert_eq!(s, [1, 40, 30, 20, 60, 1]);Run

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

Returns `true` if the slice contains an element with the given value.

# Examples

    let v = [10, 40, 30];
    assert!(v.contains(&30));
    assert!(!v.contains(&50));Run

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

Returns `true` if `needle` is a prefix of the slice.

# Examples

    let v = [10, 40, 30];
    assert!(v.starts_with(&[10]));
    assert!(v.starts_with(&[10, 40]));
    assert!(!v.starts_with(&[50]));
    assert!(!v.starts_with(&[10, 50]));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

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

Returns `true` if `needle` is a suffix of the slice.

# Examples

    let v = [10, 40, 30];
    assert!(v.ends_with(&[30]));
    assert!(v.ends_with(&[40, 30]));
    assert!(!v.ends_with(&[50]));
    assert!(!v.ends_with(&[50, 30]));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

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

Binary searches this sorted slice for a given element.

If the value is found then `Ok` is returned, containing the index of the matching element; if the value is not found then `Err` is returned, containing the index where a matching element could be inserted while maintaining sorted order.

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

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

Binary searches this sorted slice with a comparator function.

The comparator function should implement an order consistent with the sort order of the underlying slice, returning an order code that indicates whether its argument is `Less`, `Equal` or `Greater` the desired target.

If a matching value is found then returns `Ok`, containing the index for the matched element; if no match is found then `Err` is returned, containing the index where a matching element could be inserted while maintaining sorted order.

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

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

#### `fn sort(&mut self) where
T: Ord,`

Sorts the slice.

This sort is stable (i.e. does not reorder equal elements) and `O(n log n)` worst-case.

When applicable, unstable sorting is preferred because it is generally faster than stable sorting and it doesn't allocate auxiliary memory. See `sort_unstable`.

# Current implementation

The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.

Also, it allocates temporary storage half the size of `self`, but for short slices a non-allocating insertion sort is used instead.

# Examples

    let mut v = [-5, 4, 1, -3, 2];

    v.sort();
    assert!(v == [-5, -3, 1, 2, 4]);Run

#### `fn sort_by<F>(&mut self, compare: F) where
F: FnMut(&T, &T) -> Ordering,`

Sorts the slice with a comparator function.

This sort is stable (i.e. does not reorder equal elements) and `O(n log n)` worst-case.

When applicable, unstable sorting is preferred because it is generally faster than stable sorting and it doesn't allocate auxiliary memory. See `sort_unstable_by`.

# Current implementation

The current algorithm is an adaptive, iterative merge sort inspired by timsort. It is designed to be very fast in cases where the slice is nearly sorted, or consists of two or more sorted sequences concatenated one after another.

Also, it allocates temporary storage half the size of `self`, but for short slices a non-allocating insertion sort is used instead.

# Examples

    let mut v = [5, 4, 1, 3, 2];
    v.sort_by(|a, b| a.cmp(b));
    assert!(v == [1, 2, 3, 4, 5]);

    // reverse sorting
    v.sort_by(|a, b| b.cmp(a));
    assert!(v == [5, 4, 3, 2, 1]);Run

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

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

#### `fn sort_unstable(&mut self) where
T: Ord,`
1.20.0

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 Orson Peters' pattern-defeating quicksort, which is a quicksort variant designed to be very fast on certain kinds of patterns, sometimes achieving linear time. It is randomized but deterministic, and falls back to heapsort on degenerate inputs.

It is generally 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

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

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 Orson Peters' pattern-defeating quicksort, which is a quicksort variant designed to be very fast on certain kinds of patterns, sometimes achieving linear time. It is randomized but deterministic, and falls back to heapsort on degenerate inputs.

It is generally 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

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

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 Orson Peters' pattern-defeating quicksort, which is a quicksort variant designed to be very fast on certain kinds of patterns, sometimes achieving linear time. It is randomized but deterministic, and falls back to heapsort on degenerate inputs.

It is generally 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

#### `fn rotate(&mut self, mid: usize)`

🔬 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

#### `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`.

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.

# Example

    let mut dst = [0, 0, 0];
    let src = [1, 2, 3];

    dst.clone_from_slice(&src);
    assert!(dst == [1, 2, 3]);Run

#### `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`.

If `src` does not implement `Copy`, use `clone_from_slice`.

# Panics

This function will panic if the two slices have different lengths.

# Example

    let mut dst = [0, 0, 0];
    let src = [1, 2, 3];

    dst.copy_from_slice(&src);
    assert_eq!(src, dst);Run

#### `fn to_vec(&self) -> Vec<T> where
T: Clone,`

Copies `self` into a new `Vec`.

# Examples

    let s = [10, 40, 30];
    let x = s.to_vec();
    // Here, `s` and `x` can be modified independently.Run

#### `fn into_vec(self: Box<[T]>) -> Vec<T>`

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

## Trait Implementations

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

#### `fn fmt(&self, f: &mut Formatter) -> Result<(), Error>`

Formats the value using the given formatter.

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

Implements comparison of vectors lexicographically.

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

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

#### `fn le(&self, other: &Rhs) -> bool`

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`

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

#### `fn ge(&self, other: &Rhs) -> bool`

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

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

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

🔬 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>,`

🔬 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, I> Index<I> for [T] where
I: SliceIndex<[T]>,`
[src]

#### `type Output = <I as SliceIndex<[T]>>::Output`

The returned type after indexing

#### `fn index(&self, index: I) -> &<I as SliceIndex<[T]>>::Output`

The method for the indexing (`container[index]`) operation

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

#### `fn as_ref(&self) -> &[T]`

Performs the conversion.

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

#### `fn hash<H>(&self, state: &mut H) where
H: Hasher,`

Feeds this value into the given [`Hasher`]. Read more

#### `fn hash_slice<H>(data: &[Self], state: &mut H) where
H: Hasher,`
1.3.0

Feeds a slice of this type into the given [`Hasher`]. Read more

### `impl<'a, T> Default for &'a mut [T]`
1.5.0
[src]

#### `fn default() -> &'a mut [T]`

Creates a mutable empty slice.

### `impl<'a, T> Default for &'a [T]`
[src]

#### `fn default() -> &'a [T]`

Creates an empty slice.

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

Implements comparison of vectors lexicographically.

#### `fn cmp(&self, other: &[T]) -> Ordering`

This method returns an `Ordering` between `self` and `other`. Read more

#### `fn max(self, other: Self) -> Self`

🔬 This is a nightly-only experimental API. (`ord_max_min` #25663)

Compares and returns the maximum of two values. Read more

#### `fn min(self, other: Self) -> Self`

🔬 This is a nightly-only experimental API. (`ord_max_min` #25663)

Compares and returns the minimum of two values. Read more

### `impl<'a, 'b, A, B> PartialEq<[A; 28]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 7]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 30]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 27]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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] where
B: PartialEq<A>,`
[src]

#### `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; 30]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 13]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 5]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 21]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 15]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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> PartialEq<[B]> for [A] where
A: PartialEq<B>,`
[src]

#### `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<'a, 'b, A, B> PartialEq<[A; 22]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 12]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 19]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 26]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 0]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 31]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 23]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 1]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 18]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 11]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 18]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 12]> for [B] where
B: PartialEq<A>,`
[src]

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

#### `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; 31]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 4]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 7]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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] where
B: PartialEq<A>,`
[src]

#### `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; 20]> for &'b [B] where
B: PartialEq<A>,`
[src]

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

#### `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; 28]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 19]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 17]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 8]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 32]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 29]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 14]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 11]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 24]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 32]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 26]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 22]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 1]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 3]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 15]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 32]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 14]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 21]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 31]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 17]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 30]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 24]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 20]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 29]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 23]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 10]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 5]> for &'b [B] where
B: PartialEq<A>,`
[src]

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

#### `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; 13]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 5]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 29]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 14]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 22]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 27]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 3]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 1]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 4]> for &'b [B] where
B: PartialEq<A>,`
[src]

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

#### `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; 9]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 8]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 25]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 6]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 11]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 9]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 0]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 23]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 2]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 28]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 16]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 10]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 3]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 18]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 25]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 0]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 16]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 26]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 15]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 24]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 10]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 25]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 8]> for [B] where
B: PartialEq<A>,`
[src]

#### `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; 12]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 9]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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; 6]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 19]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 21]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 16]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

#### `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; 2]> for &'b mut [B] where
B: PartialEq<A>,`
[src]

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

#### `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; 17]> for &'b [B] where
B: PartialEq<A>,`
[src]

#### `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<T> AsMut<[T]> for [T]`
[src]

#### `fn as_mut(&mut self) -> &mut [T]`

Performs the conversion.

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

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

stable interface provided by `impl [T]` in later crates

#### `fn iter(&self) -> Iter<T>`

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

stable interface provided by `impl [T]` in later crates

#### `fn split<P>(&self, pred: P) -> Split<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn rsplit<P>(&self, pred: P) -> RSplit<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn splitn<P>(&self, n: usize, pred: P) -> SplitN<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn rsplitn<P>(&self, n: usize, pred: P) -> RSplitN<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn windows(&self, size: usize) -> Windows<T>`

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

stable interface provided by `impl [T]` in later crates

#### `fn chunks(&self, size: usize) -> Chunks<T>`

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

stable interface provided by `impl [T]` in later crates

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

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

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

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

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

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

stable interface provided by `impl [T]` in later crates

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

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

🔬 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,`

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

stable interface provided by `impl [T]` in later crates

#### `fn len(&self) -> usize`

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

stable interface provided by `impl [T]` in later crates

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

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

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

stable interface provided by `impl [T]` in later crates

#### `fn iter_mut(&mut self) -> IterMut<T>`

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

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

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

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

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

stable interface provided by `impl [T]` in later crates

#### `fn split_mut<P>(&mut self, pred: P) -> SplitMut<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn rsplit_mut<P>(&mut self, pred: P) -> RSplitMut<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn splitn_mut<P>(&mut self, n: usize, pred: P) -> SplitNMut<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn rsplitn_mut<P>(&mut self, n: usize, pred: P) -> RSplitNMut<T, P> where
P: FnMut(&T) -> bool,`

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

stable interface provided by `impl [T]` in later crates

#### `fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<T>`

🔬 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)`

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

stable interface provided by `impl [T]` in later crates

#### `fn reverse(&mut self)`

🔬 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<I>(
&mut self,
index: I
) -> &mut <I as SliceIndex<[T]>>::Output where
I: SliceIndex<[T]>,`

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

🔬 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>,`

🔬 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>,`

🔬 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>,`

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

stable interface provided by `impl [T]` in later crates

#### `fn binary_search<Q>(&self, x: &Q) -> Result<usize, usize> where
Q: Ord + ?Sized,
T: Borrow<Q>,`

🔬 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)`

🔬 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,`

🔬 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,`

🔬 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, Q>(
&'a self,
b: &Q,
f: F
) -> Result<usize, usize> where
B: Borrow<Q>,
F: FnMut(&'a <[T] as SliceExt>::Item) -> B,
Q: Ord + ?Sized,`

🔬 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,`

🔬 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,`

🔬 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,`

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

stable interface provided by `impl [T]` in later crates

### `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?

#### `fn into_iter(self) -> IterMut<'a, T>`

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?

#### `fn into_iter(self) -> Iter<'a, T>`

Creates an iterator from a value. Read more

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

#### `fn index_mut(&mut self, index: I) -> &mut <I as SliceIndex<[T]>>::Output`

The method for the mutable indexing (`container[index]`) operation

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

#### `type Owned = Vec<T>`

#### `fn to_owned(&self) -> Vec<T>`

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

#### `fn clone_into(&self, target: &mut Vec<T>)`

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

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`

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

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

Deprecated since 1.3.0

: renamed to join

### `impl AsciiExt for [u8]`
[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 value in its ASCII upper case equivalent. Read more

#### `fn to_ascii_lowercase(&self) -> Vec<u8>`

Makes a copy of the value in its ASCII lower case equivalent. Read more

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

Checks that two values 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

#### `fn is_ascii_alphabetic(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII alphabetic character: U+0041 'A' ... U+005A 'Z' or U+0061 'a' ... U+007A 'z'. For strings, true if all characters in the string are ASCII alphabetic. Read more

#### `fn is_ascii_uppercase(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII uppercase character: U+0041 'A' ... U+005A 'Z'. For strings, true if all characters in the string are ASCII uppercase. Read more

#### `fn is_ascii_lowercase(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII lowercase character: U+0061 'a' ... U+007A 'z'. For strings, true if all characters in the string are ASCII lowercase. Read more

#### `fn is_ascii_alphanumeric(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII alphanumeric character: U+0041 'A' ... U+005A 'Z', U+0061 'a' ... U+007A 'z', or U+0030 '0' ... U+0039 '9'. For strings, true if all characters in the string are ASCII alphanumeric. Read more

#### `fn is_ascii_digit(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII decimal digit: U+0030 '0' ... U+0039 '9'. For strings, true if all characters in the string are ASCII digits. Read more

#### `fn is_ascii_hexdigit(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII hexadecimal digit: U+0030 '0' ... U+0039 '9', U+0041 'A' ... U+0046 'F', or U+0061 'a' ... U+0066 'f'. For strings, true if all characters in the string are ASCII hex digits. Read more

#### `fn is_ascii_punctuation(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII punctuation character: U+0021 ... U+002F `! " # $ % & ' ( ) * + , - . /` U+003A ... U+0040 `: ; < = > ? @` U+005B ... U+0060 `[ \\ ] ^ _ \``U+007B ... U+007E`{ | } ~` For strings, true if all characters in the string are ASCII punctuation. Read more

#### `fn is_ascii_graphic(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII graphic character: U+0021 '@' ... U+007E '~'. For strings, true if all characters in the string are ASCII punctuation. Read more

#### `fn is_ascii_whitespace(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII whitespace character: U+0020 SPACE, U+0009 HORIZONTAL TAB, U+000A LINE FEED, U+000C FORM FEED, or U+000D CARRIAGE RETURN. For strings, true if all characters in the string are ASCII whitespace. Read more

#### `fn is_ascii_control(&self) -> bool`

🔬 This is a nightly-only experimental API. (`ascii_ctype` #39658)

Checks if the value is an ASCII control character: U+0000 NUL ... U+001F UNIT SEPARATOR, or U+007F DELETE. Note that most ASCII whitespace characters are control characters, but SPACE is not. Read more

### `impl<'a> Read for &'a [u8]`
[src]

Read is implemented for `&[u8]` by copying from the slice.

Note that reading updates the slice to point to the yet unread part. The slice will be empty when EOF is reached.

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

#### `unsafe fn initializer(&self) -> Initializer`

🔬 This is a nightly-only experimental API. (`read_initializer` #42788)

Determines if this `Read`er can work with buffers of uninitialized memory. 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>`

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

Read all bytes until EOF in this source, placing them into `buf`. Read more

#### `fn by_ref(&mut self) -> &mut Self where
Self: Sized,`

Creates a "by reference" adaptor for this instance of `Read`. Read more

#### `fn bytes(self) -> Bytes<Self> where
Self: Sized,`

Transforms this `Read` instance to an `Iterator` over its bytes. Read more

#### `fn chars(self) -> Chars<Self> where
Self: Sized,`

🔬 This is a nightly-only experimental API. (`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,`

Creates an adaptor which will chain this stream with another. Read more

#### `fn take(self, limit: u64) -> Take<Self> where
Self: Sized,`

Creates an adaptor which will read at most `limit` bytes from it. Read more

### `impl<'a> BufRead for &'a [u8]`
[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>`

Read all bytes into `buf` until the delimiter `byte` or EOF is reached. Read more

#### `fn read_line(&mut self, buf: &mut String) -> Result<usize>`

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

Returns an iterator over the contents of this reader split on the byte `byte`. Read more

#### `fn lines(self) -> Lines<Self> where
Self: Sized,`

Returns an iterator over the lines of this reader. Read more

### `impl<'a> Write for &'a mut [u8]`
[src]

Write is implemented for `&mut [u8]` by copying into the slice, overwriting its data.

Note that writing updates the slice to point to the yet unwritten part. The slice will be empty when it has been completely overwritten.

#### `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<()>`

Writes a formatted string into this writer, returning any error encountered. Read more

#### `fn by_ref(&mut self) -> &mut Self where
Self: Sized,`

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

# Help

## Keyboard Shortcuts

?
  Show this help dialog
S
  Focus the search field
⇤
  Move up in search results
⇥
  Move down in search results
⏎
  Go to active search result
+
  Collapse/expand all sections

## Search Tricks

Prefix searches with a type followed by a colon (e.g. `fn:`) to restrict the search to a given type.

Accepted types are: `fn`, `mod`, `struct`, `enum`, `trait`, `type`, `macro`, and `const`.

Search functions by type signature (e.g. `vec -> usize` or `* -> vec`)