std::slice

Primitive Type slice

A dynamically-sized view into a contiguous sequence, [T].

Slices are a view into a block of memory represented as a pointer and a length.

// slicing a Vec
let vec = vec![1, 2, 3];
let int_slice = &vec[..];
// coercing an array to a slice
let str_slice: &[&str] = &["one", "two", "three"];

Slices are either mutable or shared. The shared slice type is &[T], while the mutable slice type is &mut [T], where T represents the element type. For example, you can mutate the block of memory that a mutable slice points to:

let x = &mut [1, 2, 3];
x[1] = 7;
assert_eq!(x, &[1, 7, 3]);

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

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

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

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

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

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

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

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

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

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

`fn get(&self, index: I) -> Option<&>::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));

`fn get_mut( &mut self, index: I ) -> Option<&mut >::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]);

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

Returns a reference to an element or subslice, without doing bounds checking. So use it very carefully!

Examples

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

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

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

Returns a mutable reference to an element or subslice, without doing bounds checking. So use it very carefully!

Examples

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

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

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

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

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

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

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

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

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

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

If the slice is shorter than size:

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

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

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

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

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

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

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

If the first element is matched, an empty slice will be the first item returned by the iterator. Similarly, if the last element in the slice is matched, an empty slice will be the last item returned by the iterator:

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

assert_eq!(iter.next().unwrap(), &[10, 40]);
assert_eq!(iter.next().unwrap(), &[]);
assert!(iter.next().is_none());

If two matched elements are directly adjacent, an empty slice will be present between them:

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

assert_eq!(iter.next().unwrap(), &[10]);
assert_eq!(iter.next().unwrap(), &[]);
assert_eq!(iter.next().unwrap(), &[20]);
assert!(iter.next().is_none());

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Examples

Looks up a series of four elements in a slice of pairs sorted by their second elements. The first is found, with a uniquely determined position; the second and third are not found; the fourth could match any position in [1, 4].

let s = [(0, 0), (2, 1), (4, 1), (5, 1), (3, 1),
         (1, 2), (2, 3), (4, 5), (5, 8), (3, 13),
         (1, 21), (2, 34), (4, 55)];

assert_eq!(s.binary_search_by_key(&13, |&(a,b)| b),  Ok(9));
assert_eq!(s.binary_search_by_key(&4, |&(a,b)| b),   Err(7));
assert_eq!(s.binary_search_by_key(&100, |&(a,b)| b), Err(13));
let r = s.binary_search_by_key(&1, |&(a,b)| b);
assert!(match r { Ok(1...4) => true, _ => false, });

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

Sorts the slice.

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

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

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

Current implementation

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

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

Current implementation

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

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

???? This is a nightly-only experimental API. (sort_unstable #40585)

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

#![feature(sort_unstable)]

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

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

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

???? This is a nightly-only experimental API. (sort_unstable #40585)

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

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

#![feature(sort_unstable)]

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

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

???? This is a nightly-only experimental API. (sort_unstable #40585)

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

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

#![feature(sort_unstable)]

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

v.sort_unstable_by_key(|k| k.abs());
assert!(v == [1, 2, -3, 4, -5]);

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

Copies the elements from src into self.

The length of src must be the same as self.

Panics

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

Example

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

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

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

Copies all elements from src into self, using a memcpy.

The length of src must be the same as self.

Panics

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

Example

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

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

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

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.

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

Converts self into a vector without clones or allocation.

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

Trait Implementations

`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<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<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> Eq for [T] where T: Eq,` [src]

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

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

Creates an empty slice.

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

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

Creates a mutable empty slice.

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

`type Output = >::Output`

The returned type after indexing

`fn index(&self, index: I) -> &>::Output`

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

`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(&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(&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(&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(&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(&self, index: I) -> Option<&>::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(&self, index: I) -> &>::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( &mut self, index: I ) -> Option<&mut >::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(&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(&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(&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(&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( &mut self, index: I ) -> &mut >::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 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<T> AsMut<[T]> for [T]` [src]

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

Performs the conversion.

`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<'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> Ord for [T] where T: Ord,` [src]

Implements comparison of vectors lexicographically.