Primitive Type slice1.0.0[−]

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

See also the std::slice module.

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

Methods

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

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

Returns the number of elements in the slice.

Examples

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

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

Returns true if the slice has a length of 0.

Examples

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

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

Returns the first element of the slice, or None if it is empty.

Examples

let v = [10, 40, 30];
assert_eq!(Some(&10), v.first());

let w: &[i32] = &[];
assert_eq!(None, w.first());Run

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

Returns a mutable pointer to the first element of the slice, or None if it is empty.

Examples

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

if let Some(first) = x.first_mut() {
    *first = 5;
}
assert_eq!(x, &[5, 1, 2]);Run

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

Returns the first and all the rest of the elements of the slice, or None if it is empty.

Examples

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

if let Some((first, elements)) = x.split_first() {
    assert_eq!(first, &0);
    assert_eq!(elements, &[1, 2]);
}Run

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

Returns the first and all the rest of the elements of the slice, or None if it is empty.

Examples

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

if let Some((first, elements)) = x.split_first_mut() {
    *first = 3;
    elements[0] = 4;
    elements[1] = 5;
}
assert_eq!(x, &[3, 4, 5]);Run

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

Returns the last and all the rest of the elements of the slice, or None if it is empty.

Examples

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

if let Some((last, elements)) = x.split_last() {
    assert_eq!(last, &2);
    assert_eq!(elements, &[0, 1]);
}Run

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

Returns the last and all the rest of the elements of the slice, or None if it is empty.

Examples

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

if let Some((last, elements)) = x.split_last_mut() {
    *last = 3;
    elements[0] = 4;
    elements[1] = 5;
}
assert_eq!(x, &[4, 5, 3]);Run

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

Returns the last element of the slice, or None if it is empty.

Examples

let v = [10, 40, 30];
assert_eq!(Some(&30), v.last());

let w: &[i32] = &[];
assert_eq!(None, w.last());Run

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

Returns a mutable pointer to the last item in the slice.

Examples

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

if let Some(last) = x.last_mut() {
    *last = 10;
}
assert_eq!(x, &[0, 1, 10]);Run

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

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

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

Examples

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

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

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

Examples

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

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

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

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

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

Examples

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

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

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

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

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

Examples

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

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

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

Returns a raw pointer to the slice's buffer.

The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.

Modifying the container referenced by this slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.

Examples

let x = &[1, 2, 4];
let x_ptr = x.as_ptr();

unsafe {
    for i in 0..x.len() {
        assert_eq!(x.get_unchecked(i), &*x_ptr.offset(i as isize));
    }
}Run

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

Returns an unsafe mutable pointer to the slice's buffer.

The caller must ensure that the slice outlives the pointer this function returns, or else it will end up pointing to garbage.

Modifying the container referenced by this slice may cause its buffer to be reallocated, which would also make any pointers to it invalid.

Examples

let x = &mut [1, 2, 4];
let x_ptr = x.as_mut_ptr();

unsafe {
    for i in 0..x.len() {
        *x_ptr.offset(i as isize) += 2;
    }
}
assert_eq!(x, &[3, 4, 6]);Run

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

Swaps two elements in the slice.

Arguments

a - The index of the first element
b - The index of the second element

Panics

Panics if a or b are out of bounds.

Examples

let mut v = ["a", "b", "c", "d"];
v.swap(1, 3);
assert!(v == ["a", "d", "c", "b"]);Run

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

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

Examples

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

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

Returns an iterator over the slice.

Examples

let x = &[1, 2, 4];
let mut iterator = x.iter();

assert_eq!(iterator.next(), Some(&1));
assert_eq!(iterator.next(), Some(&2));
assert_eq!(iterator.next(), Some(&4));
assert_eq!(iterator.next(), None);Run

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

Returns an iterator that allows modifying each value.

Examples

let x = &mut [1, 2, 4];
for elem in x.iter_mut() {
    *elem += 2;
}
assert_eq!(x, &[3, 4, 6]);Run

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

Returns an iterator over all contiguous windows of length size. The windows overlap. If the slice is shorter than size, the iterator returns no values.

Panics

Panics if size is 0.

Examples

let slice = ['r', 'u', 's', 't'];
let mut iter = slice.windows(2);
assert_eq!(iter.next().unwrap(), &['r', 'u']);
assert_eq!(iter.next().unwrap(), &['u', 's']);
assert_eq!(iter.next().unwrap(), &['s', 't']);
assert!(iter.next().is_none());Run

If the slice is shorter than size:

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

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

Returns an iterator over chunk_size elements of the slice at a time. The chunks are slices and do not overlap. If chunk_size does not divide the length of the slice, then the last chunk will not have length chunk_size.

See exact_chunks for a variant of this iterator that returns chunks of always exactly chunk_size elements.

Panics

Panics if chunk_size is 0.

Examples

let slice = ['l', 'o', 'r', 'e', 'm'];
let mut iter = slice.chunks(2);
assert_eq!(iter.next().unwrap(), &['l', 'o']);
assert_eq!(iter.next().unwrap(), &['r', 'e']);
assert_eq!(iter.next().unwrap(), &['m']);
assert!(iter.next().is_none());Run

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

Returns an iterator over chunk_size elements of the slice at a time. The chunks are mutable slices, and do not overlap. If chunk_size does not divide the length of the slice, then the last chunk will not have length chunk_size.

See exact_chunks_mut for a variant of this iterator that returns chunks of always exactly chunk_size elements.

Panics

Panics if chunk_size is 0.

Examples

let v = &mut [0, 0, 0, 0, 0];
let mut count = 1;

for chunk in v.chunks_mut(2) {
    for elem in chunk.iter_mut() {
        *elem += count;
    }
    count += 1;
}
assert_eq!(v, &[1, 1, 2, 2, 3]);Run

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

🔬 This is a nightly-only experimental API. (exact_chunks #47115)

Returns an iterator over chunk_size elements of the slice at a time. The chunks are slices and do not overlap. If chunk_size does not divide the length of the slice, then the last up to chunk_size-1 elements will be omitted.

Due to each chunk having exactly chunk_size elements, the compiler can often optimize the resulting code better than in the case of chunks.

Panics

Panics if chunk_size is 0.

Examples

#![feature(exact_chunks)]

let slice = ['l', 'o', 'r', 'e', 'm'];
let mut iter = slice.exact_chunks(2);
assert_eq!(iter.next().unwrap(), &['l', 'o']);
assert_eq!(iter.next().unwrap(), &['r', 'e']);
assert!(iter.next().is_none());Run

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

🔬 This is a nightly-only experimental API. (exact_chunks #47115)

Returns an iterator over chunk_size elements of the slice at a time. The chunks are mutable slices, and do not overlap. If chunk_size does not divide the length of the slice, then the last up to chunk_size-1 elements will be omitted.

Due to each chunk having exactly chunk_size elements, the compiler can often optimize the resulting code better than in the case of chunks_mut.

Panics

Panics if chunk_size is 0.

Examples

#![feature(exact_chunks)]

let v = &mut [0, 0, 0, 0, 0];
let mut count = 1;

for chunk in v.exact_chunks_mut(2) {
    for elem in chunk.iter_mut() {
        *elem += count;
    }
    count += 1;
}
assert_eq!(v, &[1, 1, 2, 2, 0]);Run

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

Divides one slice into two at an index.

The first will contain all indices from [0, mid) (excluding the index mid itself) and the second will contain all indices from [mid, len) (excluding the index len itself).

Panics

Panics if mid > len.

Examples

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

{
   let (left, right) = v.split_at(0);
   assert!(left == []);
   assert!(right == [1, 2, 3, 4, 5, 6]);
}

{
    let (left, right) = v.split_at(2);
    assert!(left == [1, 2]);
    assert!(right == [3, 4, 5, 6]);
}

{
    let (left, right) = v.split_at(6);
    assert!(left == [1, 2, 3, 4, 5, 6]);
    assert!(right == []);
}Run

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

Divides one mutable slice into two at an index.

The first will contain all indices from [0, mid) (excluding the index mid itself) and the second will contain all indices from [mid, len) (excluding the index len itself).

Panics

Panics if mid > len.

Examples

let mut v = [1, 0, 3, 0, 5, 6];
// scoped to restrict the lifetime of the borrows
{
    let (left, right) = v.split_at_mut(2);
    assert!(left == [1, 0]);
    assert!(right == [3, 0, 5, 6]);
    left[1] = 2;
    right[1] = 4;
}
assert!(v == [1, 2, 3, 4, 5, 6]);Run

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

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

Examples

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

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

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

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

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

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

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

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

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

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

Examples

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

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

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

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

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.

let v = &[0, 1, 1, 2, 3, 5, 8];
let mut it = v.rsplit(|n| *n % 2 == 0);
assert_eq!(it.next().unwrap(), &[]);
assert_eq!(it.next().unwrap(), &[3, 5]);
assert_eq!(it.next().unwrap(), &[1, 1]);
assert_eq!(it.next().unwrap(), &[]);
assert_eq!(it.next(), None);Run

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

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

let mut v = [100, 400, 300, 200, 600, 500];

let mut count = 0;
for group in v.rsplit_mut(|num| *num % 3 == 0) {
    count += 1;
    group[0] = count;
}
assert_eq!(v, [3, 400, 300, 2, 600, 1]);Run

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

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

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

Examples

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

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

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

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

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

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

Examples

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

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

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

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

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

Examples

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

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

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

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

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

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

Examples

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

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

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

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

Examples

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

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

Returns true if needle is a prefix of the slice.

Examples

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

Always returns true if needle is an empty slice:

let v = &[10, 40, 30];
assert!(v.starts_with(&[]));
let v: &[u8] = &[];
assert!(v.starts_with(&[]));Run

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

Returns true if needle is a suffix of the slice.

Examples

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

Always returns true if needle is an empty slice:

let v = &[10, 40, 30];
assert!(v.ends_with(&[]));
let v: &[u8] = &[];
assert!(v.ends_with(&[]));Run

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

Binary searches this sorted slice for a given element.

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

Examples

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

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

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

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

Binary searches this sorted slice with a comparator function.

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

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

Examples

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

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

let seek = 13;
assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Ok(9));
let seek = 4;
assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(7));
let seek = 100;
assert_eq!(s.binary_search_by(|probe| probe.cmp(&seek)), Err(13));
let seek = 1;
let r = s.binary_search_by(|probe| probe.cmp(&seek));
assert!(match r { Ok(1...4) => true, _ => false, });Run

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

Binary searches this sorted slice with a key extraction function.

Assumes that the slice is sorted by the key, for instance with sort_by_key using the same key extraction function.

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

Examples

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

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

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

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

Sorts the slice, but may not preserve the order of equal elements.

This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate), and O(n log n) worst-case.

Current implementation

The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior.

It is typically faster than stable sorting, except in a few special cases, e.g. when the slice consists of several concatenated sorted sequences.

Examples

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

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

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

Sorts the slice with a comparator function, but may not preserve the order of equal elements.

This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate), and O(n log n) worst-case.

Current implementation

The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior.

It is typically faster than stable sorting, except in a few special cases, e.g. when the slice consists of several concatenated sorted sequences.

Examples

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

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

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

Sorts the slice with a key extraction function, but may not preserve the order of equal elements.

This sort is unstable (i.e. may reorder equal elements), in-place (i.e. does not allocate), and O(m n log(m n)) worst-case, where the key function is O(m).

Current implementation

The current algorithm is based on pattern-defeating quicksort by Orson Peters, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on slices with certain patterns. It uses some randomization to avoid degenerate cases, but with a fixed seed to always provide deterministic behavior.

Examples

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

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

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

Rotates the slice in-place such that the first mid elements of the slice move to the end while the last self.len() - mid elements move to the front. After calling rotate_left, the element previously at index mid will become the first element in the slice.

Panics

This function will panic if mid is greater than the length of the slice. Note that mid == self.len() does not panic and is a no-op rotation.

Complexity

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

Examples

let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
a.rotate_left(2);
assert_eq!(a, ['c', 'd', 'e', 'f', 'a', 'b']);Run

Rotating a subslice:

let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
a[1..5].rotate_left(1);
assert_eq!(a, ['a', 'c', 'd', 'e', 'b', 'f']);Run

`pub fn rotate_right(&mut self, k: usize)`
1.26.0
[src]

Rotates the slice in-place such that the first self.len() - k elements of the slice move to the end while the last k elements move to the front. After calling rotate_right, the element previously at index self.len() - k will become the first element in the slice.

Panics

This function will panic if k is greater than the length of the slice. Note that k == self.len() does not panic and is a no-op rotation.

Complexity

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

Examples

let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
a.rotate_right(2);
assert_eq!(a, ['e', 'f', 'a', 'b', 'c', 'd']);Run

Rotate a subslice:

let mut a = ['a', 'b', 'c', 'd', 'e', 'f'];
a[1..5].rotate_right(1);
assert_eq!(a, ['a', 'e', 'b', 'c', 'd', 'f']);Run

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

Copies the elements from src into self.

The length of src must be the same as self.

If src implements Copy, it can be more performant to use copy_from_slice.

Panics

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

Examples

Cloning two elements from a slice into another:

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

dst.clone_from_slice(&src[2..]);

assert_eq!(src, [1, 2, 3, 4]);
assert_eq!(dst, [3, 4]);Run

Rust enforces that there can only be one mutable reference with no immutable references to a particular piece of data in a particular scope. Because of this, attempting to use clone_from_slice on a single slice will result in a compile failure:

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

slice[..2].clone_from_slice(&slice[3..]); // compile fail!Run

To work around this, we can use split_at_mut to create two distinct sub-slices from a slice:

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

{
    let (left, right) = slice.split_at_mut(2);
    left.clone_from_slice(&right[1..]);
}

assert_eq!(slice, [4, 5, 3, 4, 5]);Run

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

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

The length of src must be the same as self.

If src does not implement Copy, use clone_from_slice.

Panics

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

Examples

Copying two elements from a slice into another:

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

dst.copy_from_slice(&src[2..]);

assert_eq!(src, [1, 2, 3, 4]);
assert_eq!(dst, [3, 4]);Run

Rust enforces that there can only be one mutable reference with no immutable references to a particular piece of data in a particular scope. Because of this, attempting to use copy_from_slice on a single slice will result in a compile failure:

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

slice[..2].copy_from_slice(&slice[3..]); // compile fail!Run

To work around this, we can use split_at_mut to create two distinct sub-slices from a slice:

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

{
    let (left, right) = slice.split_at_mut(2);
    left.copy_from_slice(&right[1..]);
}

assert_eq!(slice, [4, 5, 3, 4, 5]);Run

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

Swaps all elements in self with those in other.

The length of other must be the same as self.

Panics

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

Example

Swapping two elements across slices:

let mut slice1 = [0, 0];
let mut slice2 = [1, 2, 3, 4];

slice1.swap_with_slice(&mut slice2[2..]);

assert_eq!(slice1, [3, 4]);
assert_eq!(slice2, [1, 2, 0, 0]);Run

Rust enforces that there can only be one mutable reference to a particular piece of data in a particular scope. Because of this, attempting to use swap_with_slice on a single slice will result in a compile failure:

let mut slice = [1, 2, 3, 4, 5];
slice[..2].swap_with_slice(&mut slice[3..]); // compile fail!Run

To work around this, we can use split_at_mut to create two distinct mutable sub-slices from a slice:

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

{
    let (left, right) = slice.split_at_mut(2);
    left.swap_with_slice(&mut right[1..]);
}

assert_eq!(slice, [4, 5, 3, 1, 2]);Run

`pub unsafe fn align_to(&self) -> (&[T], &[U], &[T])`
[src]

🔬 This is a nightly-only experimental API. (slice_align_to #44488)

Transmute the slice to a slice of another type, ensuring aligment of the types is maintained.

This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle slice will have the greatest length possible for a given type and input slice.

This method has no purpose when either input element T or output element U are zero-sized and will return the original slice without splitting anything.

Unsafety

This method is essentially a transmute with respect to the elements in the returned middle slice, so all the usual caveats pertaining to transmute::<T, U> also apply here.

Examples

Basic usage:

unsafe {
    let bytes: [u8; 7] = [1, 2, 3, 4, 5, 6, 7];
    let (prefix, shorts, suffix) = bytes.align_to::<u16>();
    // less_efficient_algorithm_for_bytes(prefix);
    // more_efficient_algorithm_for_aligned_shorts(shorts);
    // less_efficient_algorithm_for_bytes(suffix);
}Run

`pub unsafe fn align_to_mut(&mut self) -> (&mut [T], &mut [U], &mut [T])`
[src]

🔬 This is a nightly-only experimental API. (slice_align_to #44488)

Transmute the slice to a slice of another type, ensuring aligment of the types is maintained.

This method splits the slice into three distinct slices: prefix, correctly aligned middle slice of a new type, and the suffix slice. The middle slice will have the greatest length possible for a given type and input slice.

This method has no purpose when either input element T or output element U are zero-sized and will return the original slice without splitting anything.

Unsafety

This method is essentially a transmute with respect to the elements in the returned middle slice, so all the usual caveats pertaining to transmute::<T, U> also apply here.

Examples

Basic usage:

unsafe {
    let mut bytes: [u8; 7] = [1, 2, 3, 4, 5, 6, 7];
    let (prefix, shorts, suffix) = bytes.align_to_mut::<u16>();
    // less_efficient_algorithm_for_bytes(prefix);
    // more_efficient_algorithm_for_aligned_shorts(shorts);
    // less_efficient_algorithm_for_bytes(suffix);
}Run

`impl [u8]`
[src]

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

スライスをソートします。

このソートは安定で (すなわち等しい要素を並べ替えない)、最悪の場合でもO(n log n)です。

可能ならば不安定なソートが望ましいです。一般に安定なソートより高速で、補助的なメモリを確保しません。sort_unstableを参照してください。

現在の実装

現在のアルゴリズムはtimsortに影響を受けた適応型で逐次のマージソートです。これはスライスがほとんどソートされている、または二つ以上のソートされた列を次々に結合したものである場合、非常に速くなるように設計されています。

また、このアルゴリズムはselfの半分の大きさの一時領域を確保しますが、短いスライスに対してはメモリを確保しない挿入ソートを代わりに使用します。

Examples

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

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

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

比較関数を利用してスライスをソートします。

このソートは安定で (すなわち等しい要素を並べ替えない)、最悪の場合でもO(n log n)です。

可能ならば不安定なソートが望ましいです。一般に安定なソートより高速で、補助的なメモリを確保しません。sort_unstable_byを参照してください。

現在の実装

現在のアルゴリズムはtimsortに影響を受けた適応型で逐次のマージソートです。これはスライスがほとんどソートされている、または二つ以上のソートされた列を次々に結合したものである場合、非常に速くなるように設計されています。

また、このアルゴリズムはselfの半分の大きさの一時領域を確保しますが、短いスライスに対してはメモリを確保しない挿入ソートを代わりに使用します。

Examples

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

// 逆順ソート
v.sort_by(|a, b| b.cmp(a));
assert!(v == [5, 4, 3, 2, 1]);Run

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

キーを取り出す関数を利用してスライスをソートします。

このソートは安定で (すなわち等しい要素を並べ替えない)、最悪の場合でもO(m n log (m n))です。ここでキー関数はO(m)としています。

可能ならば不安定なソートが望ましいです。一般に安定なソートより高速で、補助的なメモリを確保しません。sort_unstable_by_keyを参照してください。

現在の実装

現在のアルゴリズムはtimsortに影響を受けた適応型で逐次のマージソートです。これはスライスがほとんどソートされている、または二つ以上のソートされた列を次々に結合したものである場合、非常に速くなるように設計されています。

また、このアルゴリズムはselfの半分の大きさの一時領域を確保しますが、短いスライスに対してはメモリを確保しない挿入ソートを代わりに使用します。

Examples

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

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

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

🔬 This is a nightly-only experimental API. (slice_sort_by_cached_key #34447)

キーを取り出す関数を利用してスライスをソートします。

ソートの際、キー関数は要素毎に一度だけ呼ばれます。

このソートは安定で (すなわち等しい要素を並べ替えない)、最悪の場合でもO(m n log (m n))です。ここでキー関数はO(m)としています。

単純なキー関数については (例えばプロパティアクセスや基本的な操作)、sort_by_keyのほうが恐らく高速です。

現在の実装

現在のアルゴリズムはOrson Petersによるpattern-defeating quicksortに基づいています。 pattern-defeating quicksortは乱択クイックソートの平均的な速さとヒープソートの最悪の場合の速さを併せ持ち、特定のパターンでは線形時間で完了します。性能が悪くなる場合を避けるために乱数を使用しますが、常に決定的な振る舞いをさせるために固定されたシードを使用します。

最悪の場合、このアルゴリズムはスライスと同じ長さのVec<(K, usize)>に一時領域を確保します。

Examples

#![feature(slice_sort_by_cached_key)]
let mut v = [-5i32, 4, 32, -3, 2];

v.sort_by_cached_key(|k| k.to_string());
assert!(v == [-3, -5, 2, 32, 4]);Run

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

selfをコピーして新しいVecを作成します。

Examples

let s = [10, 40, 30];
let x = s.to_vec();
// ここで、`s`と`x`は独立して変更することができます。Run

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

selfをクローンもメモリ確保もせずにベクターに変換します。

返されたベクターはVec<T>のinto_boxed_sliceメソッドによってボックスに戻すことができます。

Examples

let s: Box<[i32]> = Box::new([10, 40, 30]);
let x = s.into_vec();
// `x`に変換したので`s`はもう使うことができません。

assert_eq!(x, vec![10, 40, 30]);Run

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

🔬 This is a nightly-only experimental API. (repeat_generic_slice #48784)

it's on str, why not on slice?

スライスをn回繰り返すことでベクターを作成します。

Examples

基本的な使用法:

#![feature(repeat_generic_slice)]

fn main() {
    assert_eq!([1, 2].repeat(3), vec![1, 2, 1, 2, 1, 2]);
}Run

`impl [u8]`
[src]

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

各バイトをASCIIの対応する大文字に変換したこのスライスのコピーを含むベクターを返します。

ASCII文字の'a'から'z'は'A'から'Z'に変換されますが、非ASCII文字は変更されません。

インプレースで大文字にするには、make_ascii_uppercaseを使用してください。

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

各バイトをASCIIの対応する小文字に変換したこのスライスのコピーを含むベクターを返します。

ASCII文字の'a'から'z'は'A'から'Z'に変換されますが、非ASCII文字は変更されません。

インプレースで小文字にするには、make_ascii_lowercaseを使用してください。

Trait Implementations

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

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

Performs the conversion.

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

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

Formats the value using the given formatter. Read more

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

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

Creates a mutable empty slice.

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

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

Creates an empty slice.

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

`type Item = &'a mut T`

The type of the elements being iterated over.

`type IntoIter = IterMut<'a, T>`

Which kind of iterator are we turning this into?

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

Creates an iterator from a value. Read more

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

`type Item = &'a T`

The type of the elements being iterated over.

`type IntoIter = Iter<'a, T>`

Which kind of iterator are we turning this into?

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

Creates an iterator from a value. Read more

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

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

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

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

API not fully fleshed out and ready to be stabilized

Associated searcher for this pattern

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

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

API not fully fleshed out and ready to be stabilized

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

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

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

API not fully fleshed out and ready to be stabilized

Checks whether the pattern matches anywhere in the haystack

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

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

API not fully fleshed out and ready to be stabilized

Checks whether the pattern matches at the front of the haystack

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

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

API not fully fleshed out and ready to be stabilized

Checks whether the pattern matches at the back of the haystack

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

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

Performs the conversion.

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

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

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

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

`type Output = >::Output`

The returned type after indexing.

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

Performs the indexing (container[index]) operation.

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

Implements comparison of vectors lexicographically.

`fn partial_cmp(&self, other: &[T]) -> Option<Ordering>`
[src]

This method returns an ordering between self and other values if one exists. Read more

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

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

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

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

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

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

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

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

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

Implements comparison of vectors lexicographically.

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

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

`fn max(self, other: Self) -> Self`
1.21.0
[src]

Compares and returns the maximum of two values. Read more

`fn min(self, other: Self) -> Self`
1.21.0
[src]

Compares and returns the minimum of two values. Read more