Struct veloren_voxygen::scene::math::Rgb

#[repr(C)]
pub struct Rgb<T> {
    pub r: T,
    pub g: T,
    pub b: T,
}

Vector type suited for RGB color data.

There is no trait bound on ColorComponent, but if T doesn’t implement it, you’ll miss some goodies.

Fields

r: T

g: T

b: T

Implementations

impl<T> Rgb<T>

pub const fn new(r: T, g: T, b: T) -> Rgb<T>

Creates a vector from elements.

impl<T> Rgb<T>

pub fn broadcast(val: T) -> Rgb<T>

where T: Copy,

Broadcasts a single value to all elements of a new vector.

This function is also named splat() in some libraries, or set1() in Intel intrinsics.

“Broadcast” was chosen as the name because it is explicit enough and is the same wording as the description in relevant Intel intrinsics.

assert_eq!(Vec4::broadcast(5), Vec4::new(5,5,5,5));
assert_eq!(Vec4::broadcast(5), Vec4::from(5));

pub fn zero() -> Rgb<T>

where T: Zero,

Creates a new vector with all elements set to zero.

assert_eq!(Vec4::zero(), Vec4::new(0,0,0,0));
assert_eq!(Vec4::zero(), Vec4::broadcast(0));
assert_eq!(Vec4::zero(), Vec4::from(0));

pub fn one() -> Rgb<T>

where T: One,

Creates a new vector with all elements set to one.

assert_eq!(Vec4::one(), Vec4::new(1,1,1,1));
assert_eq!(Vec4::one(), Vec4::broadcast(1));
assert_eq!(Vec4::one(), Vec4::from(1));

pub fn iota() -> Rgb<T>

where T: Zero + One + AddAssign + Copy,

Produces a vector of the first n integers, starting from zero, where n is the number of elements for this vector type.

The iota (ι) function, originating from APL.

See this StackOverflow answer.

This is mostly useful for debugging purposes and tests.

assert_eq!(Vec4::iota(), Vec4::new(0, 1, 2, 3));

pub const fn elem_count(&self) -> usize

Convenience method which returns the number of elements of this vector.

let v = Vec4::new(0,1,2,3);
assert_eq!(v.elem_count(), 4);

pub const ELEM_COUNT: usize = 3usize

Convenience constant representing the number of elements for this vector type.

pub fn into_tuple(self) -> (T, T, T)

Converts this into a tuple with the same number of elements by consuming.

pub fn into_array(self) -> [T; 3]

Converts this vector into a fixed-size array.

pub fn as_slice(&self) -> &[T]

View this vector as an immutable slice.

pub fn as_mut_slice(&mut self) -> &mut [T]

View this vector as a mutable slice.

pub fn from_slice(slice: &[T]) -> Rgb<T>

where T: Default + Copy,

Collects the content of a slice into a new vector. Elements are initialized to their default values.

pub fn map<D, F>(self, f: F) -> Rgb<D>

where F: FnMut(T) -> D,

Returns a memberwise-converted copy of this vector, using the given conversion closure.

let v = Vec4::new(0_f32, 1., 1.8, 3.14);
let i = v.map(|x| x.round() as i32);
assert_eq!(i, Vec4::new(0, 1, 2, 3));

Performing LERP on integer vectors by concisely converting them to floats:

let a = Vec4::new(0,1,2,3).map(|x| x as f32);
let b = Vec4::new(2,3,4,5).map(|x| x as f32);
let v = Vec4::lerp(a, b, 0.5_f32).map(|x| x.round() as i32);
assert_eq!(v, Vec4::new(1,2,3,4));

pub fn map2<D, F, S>(self, other: Rgb<S>, f: F) -> Rgb<D>

where F: FnMut(T, S) -> D,

Applies the function f to each element of two vectors, pairwise, and returns the result.

let a = Vec4::<u8>::new(255, 254, 253, 252);
let b = Vec4::<u8>::new(1, 2, 3, 4);
let v = a.map2(b, |a, b| a.wrapping_add(b));
assert_eq!(v, Vec4::zero());
let v = a.map2(b, u8::wrapping_add);
assert_eq!(v, Vec4::zero());

pub fn map3<D, F, S1, S2>(self, a: Rgb<S1>, b: Rgb<S2>, f: F) -> Rgb<D>

where F: FnMut(T, S1, S2) -> D,

Applies the function f to each element of three vectors, and returns the result.

let a = Vec4::<u8>::new(255, 254, 253, 252);
let b = Vec4::<u8>::new(1, 2, 3, 4);
let c = Vec4::<u8>::new(1, 2, 3, 4);
let v = a.map3(b, c, |a, b, c| a.wrapping_add(b) + c);
assert_eq!(v, c);

pub fn apply<F>(&mut self, f: F)

where T: Copy, F: FnMut(T) -> T,

Applies the function f to each element of this vector, in-place.

let mut v = Vec4::new(0_u32, 1, 2, 3);
v.apply(|x| x.count_ones());
assert_eq!(v, Vec4::new(0, 1, 1, 2));

pub fn apply2<F, S>(&mut self, other: Rgb<S>, f: F)

where T: Copy, F: FnMut(T, S) -> T,

Applies the function f to each element of two vectors, pairwise, in-place.

let mut a = Vec4::<u8>::new(255, 254, 253, 252);
let b = Vec4::<u8>::new(1, 2, 3, 4);
a.apply2(b, |a, b| a.wrapping_add(b));
assert_eq!(a, Vec4::zero());
a.apply2(b, u8::wrapping_add);
assert_eq!(a, b);

pub fn apply3<F, S1, S2>(&mut self, a: Rgb<S1>, b: Rgb<S2>, f: F)

where T: Copy, F: FnMut(T, S1, S2) -> T,

Applies the function f to each element of three vectors, in-place.

let mut a = Vec4::<u8>::new(255, 254, 253, 252);
let b = Vec4::<u8>::new(1, 2, 3, 4);
let c = Vec4::<u8>::new(1, 2, 3, 4);
a.apply3(b, c, |a, b, c| a.wrapping_add(b) + c);
assert_eq!(a, c);

pub fn zip<S>(self, other: Rgb<S>) -> Rgb<(T, S)>

“Zips” two vectors together into a vector of tuples.

let a = Vec4::<u8>::new(255, 254, 253, 252);
let b = Vec4::<u8>::new(1, 2, 3, 4);
assert_eq!(a.zip(b), Vec4::new((255, 1), (254, 2), (253, 3), (252, 4)));

pub fn as_<D>(self) -> Rgb<D>

where T: AsPrimitive<D>, D: 'static + Copy,

Returns a memberwise-converted copy of this vector, using AsPrimitive.

Examples

let v = Vec4::new(0_f32, 1., 2., 3.);
let i: Vec4<i32> = v.as_();
assert_eq!(i, Vec4::new(0, 1, 2, 3));

Safety

In Rust versions before 1.45.0, some uses of the as operator were not entirely safe. In particular, it was undefined behavior if a truncated floating point value could not fit in the target integer type (#10184);

let x: u8 = (1.04E+17).as_(); // UB

pub fn numcast<D>(self) -> Option<Rgb<D>>

where T: NumCast, D: NumCast,

Returns a memberwise-converted copy of this vector, using NumCast.

let v = Vec4::new(0_f32, 1., 2., 3.);
let i: Vec4<i32> = v.numcast().unwrap();
assert_eq!(i, Vec4::new(0, 1, 2, 3));

pub fn mul_add<V0, V1>(self, mul: V0, add: V1) -> Rgb<T>

where V0: Into<Rgb<T>>, V1: Into<Rgb<T>>, T: MulAdd<Output = T>,

Fused multiply-add. Returns self * mul + add, and may be implemented efficiently by the hardware.

The compiler is often able to detect this kind of operation, so generally you don’t need to use it. However, it can make your intent clear.

The name for this method is the one used by the same operation on primitive floating-point types.

let a = Vec4::new(0,1,2,3);
let b = Vec4::new(4,5,6,7);
let c = Vec4::new(8,9,0,1);
assert_eq!(a*b+c, a.mul_add(b, c));

pub fn is_any_negative(&self) -> bool

where T: Signed,

Is any of the elements negative ?

This was intended for checking the validity of extent vectors, but can make sense for other types too.

pub fn are_all_positive(&self) -> bool

where T: Signed,

Are all of the elements positive ?

pub fn min<V0, V1>(a: V0, b: V1) -> Rgb<T>

where V0: Into<Rgb<T>>, V1: Into<Rgb<T>>, T: Ord,

Compares elements of a and b, and returns the minimum values into a new vector, using total ordering.

let a = Vec4::new(0,1,2,3);
let b = Vec4::new(3,2,1,0);
let m = Vec4::new(0,1,1,0);
assert_eq!(m, Vec4::min(a, b));

pub fn max<V0, V1>(a: V0, b: V1) -> Rgb<T>

where V0: Into<Rgb<T>>, V1: Into<Rgb<T>>, T: Ord,

Compares elements of a and b, and returns the maximum values into a new vector, using total ordering.

let a = Vec4::new(0,1,2,3);
let b = Vec4::new(3,2,1,0);
let m = Vec4::new(3,2,2,3);
assert_eq!(m, Vec4::max(a, b));

pub fn partial_min<V0, V1>(a: V0, b: V1) -> Rgb<T>

where V0: Into<Rgb<T>>, V1: Into<Rgb<T>>, T: PartialOrd,

Compares elements of a and b, and returns the minimum values into a new vector, using partial ordering.

let a = Vec4::new(0,1,2,3);
let b = Vec4::new(3,2,1,0);
let m = Vec4::new(0,1,1,0);
assert_eq!(m, Vec4::partial_min(a, b));

pub fn partial_max<V0, V1>(a: V0, b: V1) -> Rgb<T>

where V0: Into<Rgb<T>>, V1: Into<Rgb<T>>, T: PartialOrd,

Compares elements of a and b, and returns the maximum values into a new vector, using partial ordering.

let a = Vec4::new(0,1,2,3);
let b = Vec4::new(3,2,1,0);
let m = Vec4::new(3,2,2,3);
assert_eq!(m, Vec4::partial_max(a, b));

pub fn reduce_min(self) -> T

where T: Ord,

Returns the element which has the lowest value in this vector, using total ordering.

assert_eq!(-5, Vec4::new(0, 5, -5, 8).reduce_min());

pub fn reduce_max(self) -> T

where T: Ord,

Returns the element which has the highest value in this vector, using total ordering.

assert_eq!(8, Vec4::new(0, 5, -5, 8).reduce_max());

pub fn reduce_partial_min(self) -> T

where T: PartialOrd,

Returns the element which has the lowest value in this vector, using partial ordering.

assert_eq!(-5_f32, Vec4::new(0_f32, 5., -5., 8.).reduce_partial_min());

pub fn reduce_partial_max(self) -> T

where T: PartialOrd,

Returns the element which has the highest value in this vector, using partial ordering.

assert_eq!(8_f32, Vec4::new(0_f32, 5., -5., 8.).reduce_partial_max());

pub fn reduce_bitand(self) -> T

where T: BitAnd<Output = T>,

Returns the result of bitwise-AND (&) on all elements of this vector.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_bitand());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_bitand());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_bitand());

pub fn reduce_bitor(self) -> T

where T: BitOr<Output = T>,

Returns the result of bitwise-OR (|) on all elements of this vector.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_bitor());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_bitor());

pub fn reduce_bitxor(self) -> T

where T: BitXor<Output = T>,

Returns the result of bitwise-XOR (^) on all elements of this vector.

assert_eq!(false, Vec4::new(true, true, true, true).reduce_bitxor());
assert_eq!(true,  Vec4::new(true, false, true, true).reduce_bitxor());

pub fn reduce<F>(self, f: F) -> T

where F: FnMut(T, T) -> T,

Reduces this vector with the given accumulator closure.

pub fn product(self) -> T

where T: Mul<Output = T>,

Returns the product of each of this vector’s elements.

assert_eq!(1*2*3*4, Vec4::new(1, 2, 3, 4).product());

pub fn sum(self) -> T

where T: Add<Output = T>,

Returns the sum of each of this vector’s elements.

assert_eq!(1+2+3+4, Vec4::new(1, 2, 3, 4).sum());

pub fn average(self) -> T

where T: Add<Output = T> + Div<Output = T> + From<u8>,

Returns the average of this vector’s elements.

assert_eq!(2.5_f32, Vec4::new(1_f32, 2., 3., 4.).average());

You should avoid using it on u8 vectors, not only because integer overflows cause panics in debug mode, but also because of integer division, the result may not be the one you expect.

// This causes a panic!
let red = Vec4::new(255u8, 1, 0, 0);
let grey_level = red.average();
assert_eq!(grey_level, 128);

You may want to convert the elements to bigger integers (or floating-point) instead:

let red = Vec4::new(255u8, 1, 128, 128);

let red = red.map(|c| c as u16);
let grey_level = red.average() as u8;
assert_eq!(grey_level, 128);

let red = red.map(|c| c as f32);
let grey_level = red.average().round() as u8;
assert_eq!(grey_level, 128);

pub fn sqrt(self) -> Rgb<T>

where T: Real,

Returns a new vector which elements are the respective square roots of this vector’s elements.

let v = Vec4::new(1f32, 2f32, 3f32, 4f32);
let s = Vec4::new(1f32, 4f32, 9f32, 16f32);
assert_eq!(v, s.sqrt());

pub fn rsqrt(self) -> Rgb<T>

where T: Real,

Returns a new vector which elements are the respective reciprocal square roots of this vector’s elements.

let v = Vec4::new(1f32, 0.5f32, 1f32/3f32, 0.25f32);
let s = Vec4::new(1f32, 4f32, 9f32, 16f32);
assert_eq!(v, s.rsqrt());

pub fn recip(self) -> Rgb<T>

where T: Real,

Returns a new vector which elements are the respective reciprocal of this vector’s elements.

let v = Vec4::new(1f32, 0.5f32, 0.25f32, 0.125f32);
let s = Vec4::new(1f32, 2f32, 4f32, 8f32);
assert_eq!(v, s.recip());
assert_eq!(s, v.recip());

pub fn ceil(self) -> Rgb<T>

where T: Real,

Returns a new vector which elements are rounded to the nearest greater integer.

let v = Vec4::new(0_f32, 1., 1.8, 3.14);
assert_eq!(v.ceil(), Vec4::new(0f32, 1f32, 2f32, 4f32));

pub fn floor(self) -> Rgb<T>

where T: Real,

Returns a new vector which elements are rounded down to the nearest lower integer.

let v = Vec4::new(0_f32, 1., 1.8, 3.14);
assert_eq!(v.floor(), Vec4::new(0f32, 1f32, 1f32, 3f32));

pub fn round(self) -> Rgb<T>

where T: Real,

Returns a new vector which elements are rounded to the nearest integer.

let v = Vec4::new(0_f32, 1., 1.8, 3.14);
assert_eq!(v.round(), Vec4::new(0f32, 1f32, 2f32, 3f32));

pub fn hadd(self, rhs: Rgb<T>) -> Rgb<T>

where T: Add<Output = T>,

Horizontally adds adjacent pairs of elements in self and rhs into a new vector.

let a = Vec4::new(0, 1, 2, 3);
let b = Vec4::new(4, 5, 6, 7);
let h = Vec4::new(0+1, 2+3, 4+5, 6+7);
assert_eq!(h, a.hadd(b));

pub fn partial_cmpeq<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: PartialEq,

Compares each element of two vectors with the partial equality test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpeq(&v), Vec4::new(true, false, true, false));

pub fn partial_cmpeq_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: PartialEq + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the partial equality test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpeq(&v), Vec4::new(true, false, true, false));

pub fn partial_cmpne<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: PartialEq,

Compares each element of two vectors with the partial not-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpne(&v), Vec4::new(false, true, false, true));

pub fn partial_cmpne_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: PartialEq + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the partial not-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpne(&v), Vec4::new(false, true, false, true));

pub fn partial_cmpge<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: PartialOrd,

Compares each element of two vectors with the partial greater-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpge(&v), Vec4::new(true, true, true, false));

pub fn partial_cmpge_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: PartialOrd + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the partial greater-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpge(&v), Vec4::new(true, true, true, false));

pub fn partial_cmpgt<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: PartialOrd,

Compares each element of two vectors with the partial greater-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpgt(&v), Vec4::new(false, true, false, true));

pub fn partial_cmpgt_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: PartialOrd + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the partial greater-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmpgt(&v), Vec4::new(false, true, false, true));

pub fn partial_cmple<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: PartialOrd,

Compares each element of two vectors with the partial less-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmple(&v), Vec4::new(true, false, true, true));

pub fn partial_cmple_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: PartialOrd + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the partial less-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmple(&v), Vec4::new(true, false, true, true));

pub fn partial_cmplt<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: PartialOrd,

Compares each element of two vectors with the partial less-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmplt(&v), Vec4::new(false, false, false, true));

pub fn partial_cmplt_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: PartialOrd + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the partial less-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.partial_cmplt(&v), Vec4::new(false, false, false, true));

pub fn cmpeq<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: Eq,

Compares each element of two vectors with the partial equality test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpeq(&v), Vec4::new(true, false, true, false));

pub fn cmpeq_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: Eq + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the partial equality test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpeq(&v), Vec4::new(true, false, true, false));

pub fn cmpne<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: Eq,

Compares each element of two vectors with the total not-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpne(&v), Vec4::new(false, true, false, true));

pub fn cmpne_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: Eq + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the total not-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpne(&v), Vec4::new(false, true, false, true));

pub fn cmpge<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: Ord,

Compares each element of two vectors with the total greater-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpge(&v), Vec4::new(true, true, true, false));

pub fn cmpge_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: Ord + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the total greater-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpge(&v), Vec4::new(true, true, true, false));

pub fn cmpgt<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: Ord,

Compares each element of two vectors with the total greater-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpgt(&v), Vec4::new(false, true, false, true));

pub fn cmpgt_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: Ord + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the total greater-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,6);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmpgt(&v), Vec4::new(false, true, false, true));

pub fn cmple<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: Ord,

Compares each element of two vectors with the total less-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmple(&v), Vec4::new(true, false, true, true));

pub fn cmple_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: Ord + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the total less-or-equal test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmple(&v), Vec4::new(true, false, true, true));

pub fn cmplt<Rhs>(&self, rhs: &Rhs) -> Rgb<bool>

where Rhs: AsRef<Rgb<T>>, T: Ord,

Compares each element of two vectors with the total less-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmplt(&v), Vec4::new(false, false, false, true));

pub fn cmplt_simd(self, rhs: Rgb<T>) -> Rgb<<T as SimdElement>::Mask>

where T: Ord + SimdElement, <T as SimdElement>::Mask: FromPrimitive,

Compares each element of two vectors with the total less-than test, returning a boolean vector.

The version ending with _simd is best utilized with the features “repr_simd” and “platform_intrinsics” enabled; otherwise, it falls back to regular scalar code. Note that SIMD intrinsics do not actually distinguish partial ordering from total ordering.

let u = Vec4::new(0,2,2,2);
let v = Vec4::new(0,1,2,3);
assert_eq!(u.cmplt(&v), Vec4::new(false, false, false, true));

pub fn lerp_unclamped_precise<S>(from: Rgb<T>, to: Rgb<T>, factor: S) -> Rgb<T>

where S: Into<Rgb<T>>, T: Copy + One<Output = T> + Mul + Sub<Output = T> + MulAdd<Output = T>,

Returns the linear interpolation of from to to with factor unconstrained. See the Lerp trait.

pub fn lerp_unclamped<S>(from: Rgb<T>, to: Rgb<T>, factor: S) -> Rgb<T>

where S: Into<Rgb<T>>, T: Copy + Sub<Output = T> + MulAdd<Output = T>,

Same as lerp_unclamped_precise, implemented as a possibly faster but less precise operation. See the Lerp trait.

pub fn lerp<S>(from: Rgb<T>, to: Rgb<T>, factor: S) -> Rgb<T>

where S: Into<Rgb<T>> + Clamp + Zero + One, T: Copy + Sub<Output = T> + MulAdd<Output = T>,

Returns the linear interpolation of from to to with factor constrained to be between 0 and 1. See the Lerp trait.

pub fn lerp_precise<S>(from: Rgb<T>, to: Rgb<T>, factor: S) -> Rgb<T>

where S: Into<Rgb<T>> + Clamp + Zero + One, T: Copy + One<Output = T> + Mul + Sub<Output = T> + MulAdd<Output = T>,

Returns the linear interpolation of from to to with factor constrained to be between 0 and 1. See the Lerp trait.

impl Rgb<bool>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

pub fn reduce_ne(self) -> bool

👎Deprecated since 0.15.8: This operation makes no sense and has no native SIMD support. As the compiler reports, comparison operators such as != cannot be chained. Chaining with booleans is allowed, but whacky.

Reduces this vector using total inequality. Note that this operation doesn’t actually make much sense and has no native SIMD support.

impl Rgb<i8>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<i8>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<i16>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<i16>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<i32>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<i32>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<i64>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<i64>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<u8>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<u8>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<u16>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<u16>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<u32>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<u32>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<u64>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<Wrapping<u64>>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<f32>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl Rgb<f64>

pub fn reduce_and(self) -> bool

Returns the result of logical AND (&&) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(true,  Vec4::new(true, true, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, false, true, true).reduce_and());
assert_eq!(false, Vec4::new(true, true, true, false).reduce_and());

pub fn reduce_or(self) -> bool

Returns the result of logical OR (||) on all elements of this vector. Each element is converted to bool as follows: zero is false, and any other value is true.

assert_eq!(false, Vec4::new(false, false, false, false).reduce_or());
assert_eq!(true,  Vec4::new(false, false, true, false).reduce_or());

impl<T> Rgb<T>

pub fn into_repr_c(self) -> Rgb<T>

Converts this vector into its #[repr(C)] counterpart.

impl<T> Rgb<T>

where T: ColorComponent,

pub fn black() -> Rgb<T>

pub fn white() -> Rgb<T>

pub fn red() -> Rgb<T>

pub fn green() -> Rgb<T>

pub fn blue() -> Rgb<T>

pub fn cyan() -> Rgb<T>

pub fn magenta() -> Rgb<T>

pub fn yellow() -> Rgb<T>

pub fn gray(value: T) -> Rgb<T>

where T: Copy,

pub fn grey(value: T) -> Rgb<T>

where T: Copy,

pub fn inverted_rgb(self) -> Rgb<T>

where T: Sub<Output = T>,

Returns this color with RGB elements inverted.

let orange = Rgb::new(255_u8, 128, 0);
assert_eq!(orange.inverted_rgb(), Rgb::new(0, 127, 255));
assert_eq!(Rgb::<u8>::black().inverted_rgb(), Rgb::white());
assert_eq!(Rgb::<u8>::white().inverted_rgb(), Rgb::black());
assert_eq!(Rgb::<u8>::red().inverted_rgb(), Rgb::cyan());

pub fn average_rgb(self) -> T

where T: Add<Output = T> + Div<Output = T> + From<u8>,

Returns the average of this vector’s RGB elements.

For Rgb, this is the same as average, and is provided for compatibility with Rgba. Be careful when calling this on integer vectors. See the average() method of vectors for a discussion and example.

impl<T> Rgb<T>

pub fn shuffled_bgr(self) -> Rgb<T>

Returns this vector with R and B elements swapped.

Methods from Deref<Target = [T]>

pub fn as_flattened(&self) -> &[T]

Takes a &[[T; N]], and flattens it to a &[T].

Panics

This panics if the length of the resulting slice would overflow a usize.

This is only possible when flattening a slice of arrays of zero-sized types, and thus tends to be irrelevant in practice. If size_of::<T>() > 0, this will never panic.

Examples

assert_eq!([[1, 2, 3], [4, 5, 6]].as_flattened(), &[1, 2, 3, 4, 5, 6]);

assert_eq!(
    [[1, 2, 3], [4, 5, 6]].as_flattened(),
    [[1, 2], [3, 4], [5, 6]].as_flattened(),
);

let slice_of_empty_arrays: &[[i32; 0]] = &[[], [], [], [], []];
assert!(slice_of_empty_arrays.as_flattened().is_empty());

let empty_slice_of_arrays: &[[u32; 10]] = &[];
assert!(empty_slice_of_arrays.as_flattened().is_empty());

pub fn as_flattened_mut(&mut self) -> &mut [T]

Takes a &mut [[T; N]], and flattens it to a &mut [T].

Panics

This panics if the length of the resulting slice would overflow a usize.

This is only possible when flattening a slice of arrays of zero-sized types, and thus tends to be irrelevant in practice. If size_of::<T>() > 0, this will never panic.

Examples

fn add_5_to_all(slice: &mut [i32]) {
    for i in slice {
        *i += 5;
    }
}

let mut array = [[1, 2, 3], [4, 5, 6], [7, 8, 9]];
add_5_to_all(array.as_flattened_mut());
assert_eq!(array, [[6, 7, 8], [9, 10, 11], [12, 13, 14]]);

pub fn len(&self) -> usize

Returns the number of elements in the slice.

Examples

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

pub fn is_empty(&self) -> bool

Returns true if the slice has a length of 0.

Examples

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

let b: &[i32] = &[];
assert!(b.is_empty());

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

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

let y: &mut [i32] = &mut [];
assert_eq!(None, y.first_mut());

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

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

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

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

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

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

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

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

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

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

Returns a mutable reference to the last item in the slice, or None if it is empty.

Examples

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

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

let y: &mut [i32] = &mut [];
assert_eq!(None, y.last_mut());

pub fn first_chunk<const N: usize>(&self) -> Option<&[T; N]>

Return an array reference to the first N items in the slice.

If the slice is not at least N in length, this will return None.

Examples

let u = [10, 40, 30];
assert_eq!(Some(&[10, 40]), u.first_chunk::<2>());

let v: &[i32] = &[10];
assert_eq!(None, v.first_chunk::<2>());

let w: &[i32] = &[];
assert_eq!(Some(&[]), w.first_chunk::<0>());

pub fn first_chunk_mut<const N: usize>(&mut self) -> Option<&mut [T; N]>

Return a mutable array reference to the first N items in the slice.

If the slice is not at least N in length, this will return None.

Examples

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

if let Some(first) = x.first_chunk_mut::<2>() {
    first[0] = 5;
    first[1] = 4;
}
assert_eq!(x, &[5, 4, 2]);

assert_eq!(None, x.first_chunk_mut::<4>());

pub fn split_first_chunk<const N: usize>(&self) -> Option<(&[T; N], &[T])>

Return an array reference to the first N items in the slice and the remaining slice.

If the slice is not at least N in length, this will return None.

Examples

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

if let Some((first, elements)) = x.split_first_chunk::<2>() {
    assert_eq!(first, &[0, 1]);
    assert_eq!(elements, &[2]);
}

assert_eq!(None, x.split_first_chunk::<4>());

pub fn split_first_chunk_mut<const N: usize>( &mut self, ) -> Option<(&mut [T; N], &mut [T])>

Return a mutable array reference to the first N items in the slice and the remaining slice.

If the slice is not at least N in length, this will return None.

Examples

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

if let Some((first, elements)) = x.split_first_chunk_mut::<2>() {
    first[0] = 3;
    first[1] = 4;
    elements[0] = 5;
}
assert_eq!(x, &[3, 4, 5]);

assert_eq!(None, x.split_first_chunk_mut::<4>());

pub fn split_last_chunk<const N: usize>(&self) -> Option<(&[T], &[T; N])>

Return an array reference to the last N items in the slice and the remaining slice.

If the slice is not at least N in length, this will return None.

Examples

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

if let Some((elements, last)) = x.split_last_chunk::<2>() {
    assert_eq!(elements, &[0]);
    assert_eq!(last, &[1, 2]);
}

assert_eq!(None, x.split_last_chunk::<4>());

pub fn split_last_chunk_mut<const N: usize>( &mut self, ) -> Option<(&mut [T], &mut [T; N])>

Return a mutable array reference to the last N items in the slice and the remaining slice.

If the slice is not at least N in length, this will return None.

Examples

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

if let Some((elements, last)) = x.split_last_chunk_mut::<2>() {
    last[0] = 3;
    last[1] = 4;
    elements[0] = 5;
}
assert_eq!(x, &[5, 3, 4]);

assert_eq!(None, x.split_last_chunk_mut::<4>());

pub fn last_chunk<const N: usize>(&self) -> Option<&[T; N]>

Return an array reference to the last N items in the slice.

If the slice is not at least N in length, this will return None.

Examples

let u = [10, 40, 30];
assert_eq!(Some(&[40, 30]), u.last_chunk::<2>());

let v: &[i32] = &[10];
assert_eq!(None, v.last_chunk::<2>());

let w: &[i32] = &[];
assert_eq!(Some(&[]), w.last_chunk::<0>());

pub fn last_chunk_mut<const N: usize>(&mut self) -> Option<&mut [T; N]>

Return a mutable array reference to the last N items in the slice.

If the slice is not at least N in length, this will return None.

Examples

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

if let Some(last) = x.last_chunk_mut::<2>() {
    last[0] = 10;
    last[1] = 20;
}
assert_eq!(x, &[0, 10, 20]);

assert_eq!(None, x.last_chunk_mut::<4>());

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

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

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

For a safe alternative see get.

Safety

Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used.

You can think of this like .get(index).unwrap_unchecked(). It’s UB to call .get_unchecked(len), even if you immediately convert to a pointer. And it’s UB to call .get_unchecked(..len + 1), .get_unchecked(..=len), or similar.

Examples

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

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

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

For a safe alternative see get_mut.

Safety

Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used.

You can think of this like .get_mut(index).unwrap_unchecked(). It’s UB to call .get_unchecked_mut(len), even if you immediately convert to a pointer. And it’s UB to call .get_unchecked_mut(..len + 1), .get_unchecked_mut(..=len), or similar.

Examples

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

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

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

The caller must also ensure that the memory the pointer (non-transitively) points to is never written to (except inside an UnsafeCell) using this pointer or any pointer derived from it. If you need to mutate the contents of the slice, use as_mut_ptr.

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.add(i));
    }
}

pub 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.add(i) += 2;
    }
}
assert_eq!(x, &[3, 4, 6]);

pub fn as_ptr_range(&self) -> Range<*const T>

Returns the two raw pointers spanning the slice.

The returned range is half-open, which means that the end pointer points one past the last element of the slice. This way, an empty slice is represented by two equal pointers, and the difference between the two pointers represents the size of the slice.

See as_ptr for warnings on using these pointers. The end pointer requires extra caution, as it does not point to a valid element in the slice.

This function is useful for interacting with foreign interfaces which use two pointers to refer to a range of elements in memory, as is common in C++.

It can also be useful to check if a pointer to an element refers to an element of this slice:

let a = [1, 2, 3];
let x = &a[1] as *const _;
let y = &5 as *const _;

assert!(a.as_ptr_range().contains(&x));
assert!(!a.as_ptr_range().contains(&y));

pub fn as_mut_ptr_range(&mut self) -> Range<*mut T>

Returns the two unsafe mutable pointers spanning the slice.

The returned range is half-open, which means that the end pointer points one past the last element of the slice. This way, an empty slice is represented by two equal pointers, and the difference between the two pointers represents the size of the slice.

See as_mut_ptr for warnings on using these pointers. The end pointer requires extra caution, as it does not point to a valid element in the slice.

This function is useful for interacting with foreign interfaces which use two pointers to refer to a range of elements in memory, as is common in C++.

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

Swaps two elements in the slice.

If a equals to b, it’s guaranteed that elements won’t change value.

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", "e"];
v.swap(2, 4);
assert!(v == ["a", "b", "e", "d", "c"]);

pub unsafe fn swap_unchecked(&mut self, a: usize, b: usize)

🔬This is a nightly-only experimental API. (slice_swap_unchecked)

Swaps two elements in the slice, without doing bounds checking.

For a safe alternative see swap.

Arguments

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

Safety

Calling this method with an out-of-bounds index is undefined behavior. The caller has to ensure that a < self.len() and b < self.len().

Examples

#![feature(slice_swap_unchecked)]

let mut v = ["a", "b", "c", "d"];
// SAFETY: we know that 1 and 3 are both indices of the slice
unsafe { v.swap_unchecked(1, 3) };
assert!(v == ["a", "d", "c", "b"]);

pub fn reverse(&mut self)

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

Examples

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

pub fn iter(&self) -> Iter<'_, T>

Returns an iterator over the slice.

The iterator yields all items from start to end.

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

pub fn iter_mut(&mut self) -> IterMut<'_, T>

Returns an iterator that allows modifying each value.

The iterator yields all items from start to end.

Examples

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

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

Examples

let slice = ['l', 'o', 'r', 'e', 'm'];
let mut iter = slice.windows(3);
assert_eq!(iter.next().unwrap(), &['l', 'o', 'r']);
assert_eq!(iter.next().unwrap(), &['o', 'r', 'e']);
assert_eq!(iter.next().unwrap(), &['r', 'e', 'm']);
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());

There’s no windows_mut, as that existing would let safe code violate the “only one &mut at a time to the same thing” rule. However, you can sometimes use Cell::as_slice_of_cells in conjunction with windows to accomplish something similar:

use std::cell::Cell;

let mut array = ['R', 'u', 's', 't', ' ', '2', '0', '1', '5'];
let slice = &mut array[..];
let slice_of_cells: &[Cell<char>] = Cell::from_mut(slice).as_slice_of_cells();
for w in slice_of_cells.windows(3) {
    Cell::swap(&w[0], &w[2]);
}
assert_eq!(array, ['s', 't', ' ', '2', '0', '1', '5', 'u', 'R']);

pub fn chunks(&self, chunk_size: usize) -> Chunks<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the beginning of the slice.

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 chunks_exact for a variant of this iterator that returns chunks of always exactly chunk_size elements, and rchunks for the same iterator but starting at the end of the slice.

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

pub fn chunks_mut(&mut self, chunk_size: usize) -> ChunksMut<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the beginning of the slice.

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 chunks_exact_mut for a variant of this iterator that returns chunks of always exactly chunk_size elements, and rchunks_mut for the same iterator but starting at the end of the slice.

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

pub fn chunks_exact(&self, chunk_size: usize) -> ChunksExact<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the beginning of the slice.

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 and can be retrieved from the remainder function of the iterator.

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

See chunks for a variant of this iterator that also returns the remainder as a smaller chunk, and rchunks_exact for the same iterator but starting at the end of the slice.

Panics

Panics if chunk_size is 0.

Examples

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

pub fn chunks_exact_mut(&mut self, chunk_size: usize) -> ChunksExactMut<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the beginning of the slice.

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 and can be retrieved from the into_remainder function of the iterator.

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.

See chunks_mut for a variant of this iterator that also returns the remainder as a smaller chunk, and rchunks_exact_mut for the same iterator but starting at the end of the slice.

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_exact_mut(2) {
    for elem in chunk.iter_mut() {
        *elem += count;
    }
    count += 1;
}
assert_eq!(v, &[1, 1, 2, 2, 0]);

pub unsafe fn as_chunks_unchecked<const N: usize>(&self) -> &[[T; N]]

🔬This is a nightly-only experimental API. (slice_as_chunks)

Splits the slice into a slice of N-element arrays, assuming that there’s no remainder.

Safety

This may only be called when

• The slice splits exactly into N-element chunks (aka self.len() % N == 0).
• N != 0.

Examples

#![feature(slice_as_chunks)]
let slice: &[char] = &['l', 'o', 'r', 'e', 'm', '!'];
let chunks: &[[char; 1]] =
    // SAFETY: 1-element chunks never have remainder
    unsafe { slice.as_chunks_unchecked() };
assert_eq!(chunks, &[['l'], ['o'], ['r'], ['e'], ['m'], ['!']]);
let chunks: &[[char; 3]] =
    // SAFETY: The slice length (6) is a multiple of 3
    unsafe { slice.as_chunks_unchecked() };
assert_eq!(chunks, &[['l', 'o', 'r'], ['e', 'm', '!']]);

// These would be unsound:
// let chunks: &[[_; 5]] = slice.as_chunks_unchecked() // The slice length is not a multiple of 5
// let chunks: &[[_; 0]] = slice.as_chunks_unchecked() // Zero-length chunks are never allowed

pub fn as_chunks<const N: usize>(&self) -> (&[[T; N]], &[T])

🔬This is a nightly-only experimental API. (slice_as_chunks)

Splits the slice into a slice of N-element arrays, starting at the beginning of the slice, and a remainder slice with length strictly less than N.

Panics

Panics if N is 0. This check will most probably get changed to a compile time error before this method gets stabilized.

Examples

#![feature(slice_as_chunks)]
let slice = ['l', 'o', 'r', 'e', 'm'];
let (chunks, remainder) = slice.as_chunks();
assert_eq!(chunks, &[['l', 'o'], ['r', 'e']]);
assert_eq!(remainder, &['m']);

If you expect the slice to be an exact multiple, you can combine let-else with an empty slice pattern:

#![feature(slice_as_chunks)]
let slice = ['R', 'u', 's', 't'];
let (chunks, []) = slice.as_chunks::<2>() else {
    panic!("slice didn't have even length")
};
assert_eq!(chunks, &[['R', 'u'], ['s', 't']]);

pub fn as_rchunks<const N: usize>(&self) -> (&[T], &[[T; N]])

🔬This is a nightly-only experimental API. (slice_as_chunks)

Splits the slice into a slice of N-element arrays, starting at the end of the slice, and a remainder slice with length strictly less than N.

Panics

Panics if N is 0. This check will most probably get changed to a compile time error before this method gets stabilized.

Examples

#![feature(slice_as_chunks)]
let slice = ['l', 'o', 'r', 'e', 'm'];
let (remainder, chunks) = slice.as_rchunks();
assert_eq!(remainder, &['l']);
assert_eq!(chunks, &[['o', 'r'], ['e', 'm']]);

pub fn array_chunks<const N: usize>(&self) -> ArrayChunks<'_, T, N>

🔬This is a nightly-only experimental API. (array_chunks)

Returns an iterator over N elements of the slice at a time, starting at the beginning of the slice.

The chunks are array references and do not overlap. If N does not divide the length of the slice, then the last up to N-1 elements will be omitted and can be retrieved from the remainder function of the iterator.

This method is the const generic equivalent of chunks_exact.

Panics

Panics if N is 0. This check will most probably get changed to a compile time error before this method gets stabilized.

Examples

#![feature(array_chunks)]
let slice = ['l', 'o', 'r', 'e', 'm'];
let mut iter = slice.array_chunks();
assert_eq!(iter.next().unwrap(), &['l', 'o']);
assert_eq!(iter.next().unwrap(), &['r', 'e']);
assert!(iter.next().is_none());
assert_eq!(iter.remainder(), &['m']);

pub unsafe fn as_chunks_unchecked_mut<const N: usize>( &mut self, ) -> &mut [[T; N]]

🔬This is a nightly-only experimental API. (slice_as_chunks)

Splits the slice into a slice of N-element arrays, assuming that there’s no remainder.

Safety

This may only be called when

• The slice splits exactly into N-element chunks (aka self.len() % N == 0).
• N != 0.

Examples

#![feature(slice_as_chunks)]
let slice: &mut [char] = &mut ['l', 'o', 'r', 'e', 'm', '!'];
let chunks: &mut [[char; 1]] =
    // SAFETY: 1-element chunks never have remainder
    unsafe { slice.as_chunks_unchecked_mut() };
chunks[0] = ['L'];
assert_eq!(chunks, &[['L'], ['o'], ['r'], ['e'], ['m'], ['!']]);
let chunks: &mut [[char; 3]] =
    // SAFETY: The slice length (6) is a multiple of 3
    unsafe { slice.as_chunks_unchecked_mut() };
chunks[1] = ['a', 'x', '?'];
assert_eq!(slice, &['L', 'o', 'r', 'a', 'x', '?']);

// These would be unsound:
// let chunks: &[[_; 5]] = slice.as_chunks_unchecked_mut() // The slice length is not a multiple of 5
// let chunks: &[[_; 0]] = slice.as_chunks_unchecked_mut() // Zero-length chunks are never allowed

pub fn as_chunks_mut<const N: usize>(&mut self) -> (&mut [[T; N]], &mut [T])

🔬This is a nightly-only experimental API. (slice_as_chunks)

Splits the slice into a slice of N-element arrays, starting at the beginning of the slice, and a remainder slice with length strictly less than N.

Panics

Panics if N is 0. This check will most probably get changed to a compile time error before this method gets stabilized.

Examples

#![feature(slice_as_chunks)]
let v = &mut [0, 0, 0, 0, 0];
let mut count = 1;

let (chunks, remainder) = v.as_chunks_mut();
remainder[0] = 9;
for chunk in chunks {
    *chunk = [count; 2];
    count += 1;
}
assert_eq!(v, &[1, 1, 2, 2, 9]);

pub fn as_rchunks_mut<const N: usize>(&mut self) -> (&mut [T], &mut [[T; N]])

🔬This is a nightly-only experimental API. (slice_as_chunks)

Splits the slice into a slice of N-element arrays, starting at the end of the slice, and a remainder slice with length strictly less than N.

Panics

Panics if N is 0. This check will most probably get changed to a compile time error before this method gets stabilized.

Examples

#![feature(slice_as_chunks)]
let v = &mut [0, 0, 0, 0, 0];
let mut count = 1;

let (remainder, chunks) = v.as_rchunks_mut();
remainder[0] = 9;
for chunk in chunks {
    *chunk = [count; 2];
    count += 1;
}
assert_eq!(v, &[9, 1, 1, 2, 2]);

pub fn array_chunks_mut<const N: usize>(&mut self) -> ArrayChunksMut<'_, T, N>

🔬This is a nightly-only experimental API. (array_chunks)

Returns an iterator over N elements of the slice at a time, starting at the beginning of the slice.

The chunks are mutable array references and do not overlap. If N does not divide the length of the slice, then the last up to N-1 elements will be omitted and can be retrieved from the into_remainder function of the iterator.

This method is the const generic equivalent of chunks_exact_mut.

Panics

Panics if N is 0. This check will most probably get changed to a compile time error before this method gets stabilized.

Examples

#![feature(array_chunks)]
let v = &mut [0, 0, 0, 0, 0];
let mut count = 1;

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

pub fn array_windows<const N: usize>(&self) -> ArrayWindows<'_, T, N>

🔬This is a nightly-only experimental API. (array_windows)

Returns an iterator over overlapping windows of N elements of a slice, starting at the beginning of the slice.

This is the const generic equivalent of windows.

If N is greater than the size of the slice, it will return no windows.

Panics

Panics if N is 0. This check will most probably get changed to a compile time error before this method gets stabilized.

Examples

#![feature(array_windows)]
let slice = [0, 1, 2, 3];
let mut iter = slice.array_windows();
assert_eq!(iter.next().unwrap(), &[0, 1]);
assert_eq!(iter.next().unwrap(), &[1, 2]);
assert_eq!(iter.next().unwrap(), &[2, 3]);
assert!(iter.next().is_none());

pub fn rchunks(&self, chunk_size: usize) -> RChunks<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the end of the slice.

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 rchunks_exact for a variant of this iterator that returns chunks of always exactly chunk_size elements, and chunks for the same iterator but starting at the beginning of the slice.

Panics

Panics if chunk_size is 0.

Examples

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

pub fn rchunks_mut(&mut self, chunk_size: usize) -> RChunksMut<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the end of the slice.

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 rchunks_exact_mut for a variant of this iterator that returns chunks of always exactly chunk_size elements, and chunks_mut for the same iterator but starting at the beginning of the slice.

Panics

Panics if chunk_size is 0.

Examples

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

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

pub fn rchunks_exact(&self, chunk_size: usize) -> RChunksExact<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the end of the slice.

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 and can be retrieved from the remainder function of the iterator.

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

See rchunks for a variant of this iterator that also returns the remainder as a smaller chunk, and chunks_exact for the same iterator but starting at the beginning of the slice.

Panics

Panics if chunk_size is 0.

Examples

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

pub fn rchunks_exact_mut(&mut self, chunk_size: usize) -> RChunksExactMut<'_, T>

Returns an iterator over chunk_size elements of the slice at a time, starting at the end of the slice.

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 and can be retrieved from the into_remainder function of the iterator.

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.

See rchunks_mut for a variant of this iterator that also returns the remainder as a smaller chunk, and chunks_exact_mut for the same iterator but starting at the beginning of the slice.

Panics

Panics if chunk_size is 0.

Examples

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

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

pub fn chunk_by<F>(&self, pred: F) -> ChunkBy<'_, T, F>

where F: FnMut(&T, &T) -> bool,

Returns an iterator over the slice producing non-overlapping runs of elements using the predicate to separate them.

The predicate is called for every pair of consecutive elements, meaning that it is called on slice[0] and slice[1], followed by slice[1] and slice[2], and so on.

Examples

let slice = &[1, 1, 1, 3, 3, 2, 2, 2];

let mut iter = slice.chunk_by(|a, b| a == b);

assert_eq!(iter.next(), Some(&[1, 1, 1][..]));
assert_eq!(iter.next(), Some(&[3, 3][..]));
assert_eq!(iter.next(), Some(&[2, 2, 2][..]));
assert_eq!(iter.next(), None);

This method can be used to extract the sorted subslices:

let slice = &[1, 1, 2, 3, 2, 3, 2, 3, 4];

let mut iter = slice.chunk_by(|a, b| a <= b);

assert_eq!(iter.next(), Some(&[1, 1, 2, 3][..]));
assert_eq!(iter.next(), Some(&[2, 3][..]));
assert_eq!(iter.next(), Some(&[2, 3, 4][..]));
assert_eq!(iter.next(), None);

pub fn chunk_by_mut<F>(&mut self, pred: F) -> ChunkByMut<'_, T, F>

where F: FnMut(&T, &T) -> bool,

Returns an iterator over the slice producing non-overlapping mutable runs of elements using the predicate to separate them.

The predicate is called for every pair of consecutive elements, meaning that it is called on slice[0] and slice[1], followed by slice[1] and slice[2], and so on.

Examples

let slice = &mut [1, 1, 1, 3, 3, 2, 2, 2];

let mut iter = slice.chunk_by_mut(|a, b| a == b);

assert_eq!(iter.next(), Some(&mut [1, 1, 1][..]));
assert_eq!(iter.next(), Some(&mut [3, 3][..]));
assert_eq!(iter.next(), Some(&mut [2, 2, 2][..]));
assert_eq!(iter.next(), None);

This method can be used to extract the sorted subslices:

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

let mut iter = slice.chunk_by_mut(|a, b| a <= b);

assert_eq!(iter.next(), Some(&mut [1, 1, 2, 3][..]));
assert_eq!(iter.next(), Some(&mut [2, 3][..]));
assert_eq!(iter.next(), Some(&mut [2, 3, 4][..]));
assert_eq!(iter.next(), None);

pub 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. For a non-panicking alternative see split_at_checked.

Examples

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

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

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

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

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

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. For a non-panicking alternative see split_at_mut_checked.

Examples

let mut v = [1, 0, 3, 0, 5, 6];
let (left, right) = v.split_at_mut(2);
assert_eq!(left, [1, 0]);
assert_eq!(right, [3, 0, 5, 6]);
left[1] = 2;
right[1] = 4;
assert_eq!(v, [1, 2, 3, 4, 5, 6]);

pub unsafe fn split_at_unchecked(&self, mid: usize) -> (&[T], &[T])

Divides one slice into two at an index, without doing bounds checking.

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

For a safe alternative see split_at.

Safety

Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used. The caller has to ensure that 0 <= mid <= self.len().

Examples

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

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

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

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

pub unsafe fn split_at_mut_unchecked( &mut self, mid: usize, ) -> (&mut [T], &mut [T])

Divides one mutable slice into two at an index, without doing bounds checking.

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

For a safe alternative see split_at_mut.

Safety

Calling this method with an out-of-bounds index is undefined behavior even if the resulting reference is not used. The caller has to ensure that 0 <= mid <= self.len().

Examples

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

pub fn split_at_checked(&self, mid: usize) -> Option<(&[T], &[T])>

Divides one slice into two at an index, returning None if the slice is too short.

If mid ≤ len returns a pair of slices where 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).

Otherwise, if mid > len, returns None.

Examples

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

{
   let (left, right) = v.split_at_checked(0).unwrap();
   assert_eq!(left, []);
   assert_eq!(right, [1, -2, 3, -4, 5, -6]);
}

{
    let (left, right) = v.split_at_checked(2).unwrap();
    assert_eq!(left, [1, -2]);
    assert_eq!(right, [3, -4, 5, -6]);
}

{
    let (left, right) = v.split_at_checked(6).unwrap();
    assert_eq!(left, [1, -2, 3, -4, 5, -6]);
    assert_eq!(right, []);
}

assert_eq!(None, v.split_at_checked(7));

pub fn split_at_mut_checked( &mut self, mid: usize, ) -> Option<(&mut [T], &mut [T])>

Divides one mutable slice into two at an index, returning None if the slice is too short.

If mid ≤ len returns a pair of slices where 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).

Otherwise, if mid > len, returns None.

Examples

let mut v = [1, 0, 3, 0, 5, 6];

if let Some((left, right)) = v.split_at_mut_checked(2) {
    assert_eq!(left, [1, 0]);
    assert_eq!(right, [3, 0, 5, 6]);
    left[1] = 2;
    right[1] = 4;
}
assert_eq!(v, [1, 2, 3, 4, 5, 6]);

assert_eq!(None, v.split_at_mut_checked(7));

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

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

pub fn split_inclusive<F>(&self, pred: F) -> SplitInclusive<'_, T, F>

where F: FnMut(&T) -> bool,

Returns an iterator over subslices separated by elements that match pred. The matched element is contained in the end of the previous subslice as a terminator.

Examples

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

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

If the last element of the slice is matched, that element will be considered the terminator of the preceding slice. That slice will be the last item returned by the iterator.

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

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

pub fn split_inclusive_mut<F>(&mut self, pred: F) -> SplitInclusiveMut<'_, T, F>

where F: FnMut(&T) -> bool,

Returns an iterator over mutable subslices separated by elements that match pred. The matched element is contained in the previous subslice as a terminator.

Examples

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

for group in v.split_inclusive_mut(|num| *num % 3 == 0) {
    let terminator_idx = group.len()-1;
    group[terminator_idx] = 1;
}
assert_eq!(v, [10, 40, 1, 20, 1, 1]);

pub fn rsplit<F>(&self, pred: F) -> RSplit<'_, T, F>

where F: FnMut(&T) -> bool,

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

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

pub fn rsplit_mut<F>(&mut self, pred: F) -> RSplitMut<'_, T, F>

where F: FnMut(&T) -> bool,

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

pub 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:?}");
}

pub fn splitn_mut<F>(&mut self, n: usize, pred: F) -> SplitNMut<'_, T, F>

where F: FnMut(&T) -> bool,

Returns an iterator over mutable 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]);

pub 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:?}");
}

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

pub fn split_once<F>(&self, pred: F) -> Option<(&[T], &[T])>

where F: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (slice_split_once)

Splits the slice on the first element that matches the specified predicate.

If any matching elements are present in the slice, returns the prefix before the match and suffix after. The matching element itself is not included. If no elements match, returns None.

Examples

#![feature(slice_split_once)]
let s = [1, 2, 3, 2, 4];
assert_eq!(s.split_once(|&x| x == 2), Some((
    &[1][..],
    &[3, 2, 4][..]
)));
assert_eq!(s.split_once(|&x| x == 0), None);

pub fn rsplit_once<F>(&self, pred: F) -> Option<(&[T], &[T])>

where F: FnMut(&T) -> bool,

🔬This is a nightly-only experimental API. (slice_split_once)

Splits the slice on the last element that matches the specified predicate.

If any matching elements are present in the slice, returns the prefix before the match and suffix after. The matching element itself is not included. If no elements match, returns None.

Examples

#![feature(slice_split_once)]
let s = [1, 2, 3, 2, 4];
assert_eq!(s.rsplit_once(|&x| x == 2), Some((
    &[1, 2, 3][..],
    &[4][..]
)));
assert_eq!(s.rsplit_once(|&x| x == 0), None);

pub fn contains(&self, x: &T) -> bool

where T: PartialEq,

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

This operation is O(n).

Note that if you have a sorted slice, binary_search may be faster.

Examples

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

If you do not have a &T, but some other value that you can compare with one (for example, String implements PartialEq<str>), you can use iter().any:

let v = [String::from("hello"), String::from("world")]; // slice of `String`
assert!(v.iter().any(|e| e == "hello")); // search with `&str`
assert!(!v.iter().any(|e| e == "hi"));

pub fn starts_with(&self, needle: &[T]) -> bool

where T: PartialEq,

Returns true if needle is a prefix of the slice or equal to the slice.

Examples

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

pub fn ends_with(&self, needle: &[T]) -> bool

where T: PartialEq,

Returns true if needle is a suffix of the slice or equal to the slice.

Examples

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

pub fn strip_prefix<P>(&self, prefix: &P) -> Option<&[T]>

where P: SlicePattern<Item = T> + ?Sized, T: PartialEq,

Returns a subslice with the prefix removed.

If the slice starts with prefix, returns the subslice after the prefix, wrapped in Some. If prefix is empty, simply returns the original slice. If prefix is equal to the original slice, returns an empty slice.

If the slice does not start with prefix, returns None.

Examples

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

let prefix : &str = "he";
assert_eq!(b"hello".strip_prefix(prefix.as_bytes()),
           Some(b"llo".as_ref()));

pub fn strip_suffix<P>(&self, suffix: &P) -> Option<&[T]>

where P: SlicePattern<Item = T> + ?Sized, T: PartialEq,

Returns a subslice with the suffix removed.

If the slice ends with suffix, returns the subslice before the suffix, wrapped in Some. If suffix is empty, simply returns the original slice. If suffix is equal to the original slice, returns an empty slice.

If the slice does not end with suffix, returns None.

Examples

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

pub fn binary_search(&self, x: &T) -> Result<usize, usize>

where T: Ord,

Binary searches this slice for a given element. If the slice is not sorted, the returned result is unspecified and meaningless.

If the value is found then Result::Ok is returned, containing the index of the matching element. If there are multiple matches, then any one of the matches could be returned. The index is chosen deterministically, but is subject to change in future versions of Rust. If the value is not found then Result::Err is returned, containing the index where a matching element could be inserted while maintaining sorted order.

See also binary_search_by, binary_search_by_key, and partition_point.

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

If you want to find that whole range of matching items, rather than an arbitrary matching one, that can be done using partition_point:

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

let low = s.partition_point(|x| x < &1);
assert_eq!(low, 1);
let high = s.partition_point(|x| x <= &1);
assert_eq!(high, 5);
let r = s.binary_search(&1);
assert!((low..high).contains(&r.unwrap()));

assert!(s[..low].iter().all(|&x| x < 1));
assert!(s[low..high].iter().all(|&x| x == 1));
assert!(s[high..].iter().all(|&x| x > 1));

// For something not found, the "range" of equal items is empty
assert_eq!(s.partition_point(|x| x < &11), 9);
assert_eq!(s.partition_point(|x| x <= &11), 9);
assert_eq!(s.binary_search(&11), Err(9));

If you want to insert an item to a sorted vector, while maintaining sort order, consider using partition_point:

let mut s = vec![0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55];
let num = 42;
let idx = s.partition_point(|&x| x <= num);
// If `num` is unique, `s.partition_point(|&x| x < num)` (with `<`) is equivalent to
// `s.binary_search(&num).unwrap_or_else(|x| x)`, but using `<=` will allow `insert`
// to shift less elements.
s.insert(idx, num);
assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);

pub fn binary_search_by<'a, F>(&'a self, f: F) -> Result<usize, usize>

where F: FnMut(&'a T) -> Ordering,

Binary searches this slice with a comparator function.

The comparator function should return an order code that indicates whether its argument is Less, Equal or Greater the desired target. If the slice is not sorted or if the comparator function does not implement an order consistent with the sort order of the underlying slice, the returned result is unspecified and meaningless.

If the value is found then Result::Ok is returned, containing the index of the matching element. If there are multiple matches, then any one of the matches could be returned. The index is chosen deterministically, but is subject to change in future versions of Rust. If the value is not found then Result::Err is returned, containing the index where a matching element could be inserted while maintaining sorted order.

See also binary_search, binary_search_by_key, and partition_point.

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

pub fn binary_search_by_key<'a, B, F>( &'a self, b: &B, f: F, ) -> Result<usize, usize>

where F: FnMut(&'a T) -> B, B: Ord,

Binary searches this 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 the slice is not sorted by the key, the returned result is unspecified and meaningless.

If the value is found then Result::Ok is returned, containing the index of the matching element. If there are multiple matches, then any one of the matches could be returned. The index is chosen deterministically, but is subject to change in future versions of Rust. If the value is not found then Result::Err is returned, containing the index where a matching element could be inserted while maintaining sorted order.

See also binary_search, binary_search_by, and partition_point.

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

pub fn sort_unstable(&mut self)

where T: Ord,

Sorts the slice without preserving the initial 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.

If T: Ord does not implement a total order the resulting order is unspecified. All original elements will remain in the slice and any possible modifications via interior mutability are observed in the input. Same is true if T: Ord panics.

Current implementation

The current implementation is based on ipnsort by Lukas Bergdoll and Orson Peters, which combines the fast average case of quicksort with the fast worst case of heapsort, achieving linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the expected time to sort the data is O(n * log(k)).

It is typically faster than stable sorting, except in a few special cases, e.g., when the slice is partially sorted.

If T: Ord does not implement a total order, the implementation may panic.

Examples

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

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

pub fn sort_unstable_by<F>(&mut self, compare: F)

where F: FnMut(&T, &T) -> Ordering,

Sorts the slice with a comparator function, without preserving the initial 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.

The comparator function should define a total ordering for the elements in the slice. If the ordering is not total, the order of the elements is unspecified.

If the comparator function does not implement a total order the resulting order is unspecified. All original elements will remain in the slice and any possible modifications via interior mutability are observed in the input. Same is true if the comparator function panics. A total order (for all a, b and c):

• total and antisymmetric: exactly one of a < b, a == b or a > b is true, and
• transitive, a < b and b < c implies a < c. The same must hold for both == and >.

For example, while f64 doesn’t implement Ord because NaN != NaN, we can use partial_cmp as our sort function when we know the slice doesn’t contain a NaN.

let mut floats = [5f64, 4.0, 1.0, 3.0, 2.0];
floats.sort_unstable_by(|a, b| a.partial_cmp(b).unwrap());
assert_eq!(floats, [1.0, 2.0, 3.0, 4.0, 5.0]);

Current implementation

The current implementation is based on ipnsort by Lukas Bergdoll and Orson Peters, which combines the fast average case of quicksort with the fast worst case of heapsort, achieving linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the expected time to sort the data is O(n * log(k)).

It is typically faster than stable sorting, except in a few special cases, e.g., when the slice is partially sorted.

If T: Ord does not implement a total order, the implementation may panic.

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

pub fn sort_unstable_by_key<K, F>(&mut self, f: F)

where F: FnMut(&T) -> K, K: Ord,

Sorts the slice with a key extraction function, without preserving the initial 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.

If K: Ord does not implement a total order the resulting order is unspecified. All original elements will remain in the slice and any possible modifications via interior mutability are observed in the input. Same is true if K: Ord panics.

Current implementation

The current implementation is based on ipnsort by Lukas Bergdoll and Orson Peters, which combines the fast average case of quicksort with the fast worst case of heapsort, achieving linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the expected time to sort the data is O(n * log(k)).

It is typically faster than stable sorting, except in a few special cases, e.g., when the slice is partially sorted.

If K: Ord does not implement a total order, the implementation may panic.

Examples

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

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

pub fn select_nth_unstable( &mut self, index: usize, ) -> (&mut [T], &mut T, &mut [T])

where T: Ord,

Reorder the slice such that the element at index after the reordering is at its final sorted position.

This reordering has the additional property that any value at position i < index will be less than or equal to any value at a position j > index. Additionally, this reordering is unstable (i.e. any number of equal elements may end up at position index), in-place (i.e. does not allocate), and runs in O(n) time. This function is also known as “kth element” in other libraries.

It returns a triplet of the following from the reordered slice: the subslice prior to index, the element at index, and the subslice after index; accordingly, the values in those two subslices will respectively all be less-than-or-equal-to and greater-than-or-equal-to the value of the element at index.

Current implementation

The current algorithm is an introselect implementation based on ipnsort by Lukas Bergdoll and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime for all inputs.

It is typically faster than stable sorting, except in a few special cases, e.g., when the slice is nearly fully sorted, where slice::sort may be faster.

Panics

Panics when index >= len(), meaning it always panics on empty slices.

Examples

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

// Find the items less than or equal to the median, the median, and greater than or equal to
// the median.
let (lesser, median, greater) = v.select_nth_unstable(2);

assert!(lesser == [-3, -5] || lesser == [-5, -3]);
assert_eq!(median, &mut 1);
assert!(greater == [4, 2] || greater == [2, 4]);

// We are only guaranteed the slice will be one of the following, based on the way we sort
// about the specified index.
assert!(v == [-3, -5, 1, 2, 4] ||
        v == [-5, -3, 1, 2, 4] ||
        v == [-3, -5, 1, 4, 2] ||
        v == [-5, -3, 1, 4, 2]);

pub fn select_nth_unstable_by<F>( &mut self, index: usize, compare: F, ) -> (&mut [T], &mut T, &mut [T])

where F: FnMut(&T, &T) -> Ordering,

Reorder the slice with a comparator function such that the element at index after the reordering is at its final sorted position.

This reordering has the additional property that any value at position i < index will be less than or equal to any value at a position j > index using the comparator function. Additionally, this reordering is unstable (i.e. any number of equal elements may end up at position index), in-place (i.e. does not allocate), and runs in O(n) time. This function is also known as “kth element” in other libraries.

It returns a triplet of the following from the slice reordered according to the provided comparator function: the subslice prior to index, the element at index, and the subslice after index; accordingly, the values in those two subslices will respectively all be less-than-or-equal-to and greater-than-or-equal-to the value of the element at index.

Current implementation

The current algorithm is an introselect implementation based on ipnsort by Lukas Bergdoll and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime for all inputs.

It is typically faster than stable sorting, except in a few special cases, e.g., when the slice is nearly fully sorted, where slice::sort may be faster.

Panics

Panics when index >= len(), meaning it always panics on empty slices.

Examples

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

// Find the items less than or equal to the median, the median, and greater than or equal to
// the median as if the slice were sorted in descending order.
let (lesser, median, greater) = v.select_nth_unstable_by(2, |a, b| b.cmp(a));

assert!(lesser == [4, 2] || lesser == [2, 4]);
assert_eq!(median, &mut 1);
assert!(greater == [-3, -5] || greater == [-5, -3]);

// We are only guaranteed the slice will be one of the following, based on the way we sort
// about the specified index.
assert!(v == [2, 4, 1, -5, -3] ||
        v == [2, 4, 1, -3, -5] ||
        v == [4, 2, 1, -5, -3] ||
        v == [4, 2, 1, -3, -5]);

pub fn select_nth_unstable_by_key<K, F>( &mut self, index: usize, f: F, ) -> (&mut [T], &mut T, &mut [T])

where F: FnMut(&T) -> K, K: Ord,

Reorder the slice with a key extraction function such that the element at index after the reordering is at its final sorted position.

This reordering has the additional property that any value at position i < index will be less than or equal to any value at a position j > index using the key extraction function. Additionally, this reordering is unstable (i.e. any number of equal elements may end up at position index), in-place (i.e. does not allocate), and runs in O(n) time. This function is also known as “kth element” in other libraries.

It returns a triplet of the following from the slice reordered according to the provided key extraction function: the subslice prior to index, the element at index, and the subslice after index; accordingly, the values in those two subslices will respectively all be less-than-or-equal-to and greater-than-or-equal-to the value of the element at index.

Current implementation

The current algorithm is an introselect implementation based on ipnsort by Lukas Bergdoll and Orson Peters, which is also the basis for sort_unstable. The fallback algorithm is Median of Medians using Tukey’s Ninther for pivot selection, which guarantees linear runtime for all inputs.

It is typically faster than stable sorting, except in a few special cases, e.g., when the slice is nearly fully sorted, where slice::sort may be faster.

Panics

Panics when index >= len(), meaning it always panics on empty slices.

Examples

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

// Find the items less than or equal to the median, the median, and greater than or equal to
// the median as if the slice were sorted according to absolute value.
let (lesser, median, greater) = v.select_nth_unstable_by_key(2, |a| a.abs());

assert!(lesser == [1, 2] || lesser == [2, 1]);
assert_eq!(median, &mut -3);
assert!(greater == [4, -5] || greater == [-5, 4]);

// We are only guaranteed the slice will be one of the following, based on the way we sort
// about the specified index.
assert!(v == [1, 2, -3, 4, -5] ||
        v == [1, 2, -3, -5, 4] ||
        v == [2, 1, -3, 4, -5] ||
        v == [2, 1, -3, -5, 4]);

pub fn partition_dedup(&mut self) -> (&mut [T], &mut [T])

where T: PartialEq,

🔬This is a nightly-only experimental API. (slice_partition_dedup)

Moves all consecutive repeated elements to the end of the slice according to the PartialEq trait implementation.

Returns two slices. The first contains no consecutive repeated elements. The second contains all the duplicates in no specified order.

If the slice is sorted, the first returned slice contains no duplicates.

Examples

#![feature(slice_partition_dedup)]

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

let (dedup, duplicates) = slice.partition_dedup();

assert_eq!(dedup, [1, 2, 3, 2, 1]);
assert_eq!(duplicates, [2, 3, 1]);

pub fn partition_dedup_by<F>(&mut self, same_bucket: F) -> (&mut [T], &mut [T])

where F: FnMut(&mut T, &mut T) -> bool,

🔬This is a nightly-only experimental API. (slice_partition_dedup)

Moves all but the first of consecutive elements to the end of the slice satisfying a given equality relation.

Returns two slices. The first contains no consecutive repeated elements. The second contains all the duplicates in no specified order.

The same_bucket function is passed references to two elements from the slice and must determine if the elements compare equal. The elements are passed in opposite order from their order in the slice, so if same_bucket(a, b) returns true, a is moved at the end of the slice.

If the slice is sorted, the first returned slice contains no duplicates.

Examples

#![feature(slice_partition_dedup)]

let mut slice = ["foo", "Foo", "BAZ", "Bar", "bar", "baz", "BAZ"];

let (dedup, duplicates) = slice.partition_dedup_by(|a, b| a.eq_ignore_ascii_case(b));

assert_eq!(dedup, ["foo", "BAZ", "Bar", "baz"]);
assert_eq!(duplicates, ["bar", "Foo", "BAZ"]);

pub fn partition_dedup_by_key<K, F>(&mut self, key: F) -> (&mut [T], &mut [T])

where F: FnMut(&mut T) -> K, K: PartialEq,

🔬This is a nightly-only experimental API. (slice_partition_dedup)

Moves all but the first of consecutive elements to the end of the slice that resolve to the same key.

Returns two slices. The first contains no consecutive repeated elements. The second contains all the duplicates in no specified order.

If the slice is sorted, the first returned slice contains no duplicates.

Examples

#![feature(slice_partition_dedup)]

let mut slice = [10, 20, 21, 30, 30, 20, 11, 13];

let (dedup, duplicates) = slice.partition_dedup_by_key(|i| *i / 10);

assert_eq!(dedup, [10, 20, 30, 20, 11]);
assert_eq!(duplicates, [21, 30, 13]);

pub fn rotate_left(&mut self, mid: usize)

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

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

pub fn rotate_right(&mut self, k: usize)

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

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

pub fn fill(&mut self, value: T)

where T: Clone,

Fills self with elements by cloning value.

Examples

let mut buf = vec![0; 10];
buf.fill(1);
assert_eq!(buf, vec![1; 10]);

pub fn fill_with<F>(&mut self, f: F)

where F: FnMut() -> T,

Fills self with elements returned by calling a closure repeatedly.

This method uses a closure to create new values. If you’d rather Clone a given value, use fill. If you want to use the Default trait to generate values, you can pass Default::default as the argument.

Examples

let mut buf = vec![1; 10];
buf.fill_with(Default::default);
assert_eq!(buf, vec![0; 10]);

pub fn clone_from_slice(&mut self, src: &[T])

where T: Clone,

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.

Examples

Cloning two elements from a slice into another:

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

// Because the slices have to be the same length,
// we slice the source slice from four elements
// to two. It will panic if we don't do this.
dst.clone_from_slice(&src[2..]);

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

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!

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

pub fn copy_from_slice(&mut self, src: &[T])

where T: Copy,

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

The length of src must be the same as self.

If T 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];

// Because the slices have to be the same length,
// we slice the source slice from four elements
// to two. It will panic if we don't do this.
dst.copy_from_slice(&src[2..]);

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

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!

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

pub fn copy_within<R>(&mut self, src: R, dest: usize)

where R: RangeBounds<usize>, T: Copy,

Copies elements from one part of the slice to another part of itself, using a memmove.

src is the range within self to copy from. dest is the starting index of the range within self to copy to, which will have the same length as src. The two ranges may overlap. The ends of the two ranges must be less than or equal to self.len().

Panics

This function will panic if either range exceeds the end of the slice, or if the end of src is before the start.

Examples

Copying four bytes within a slice:

let mut bytes = *b"Hello, World!";

bytes.copy_within(1..5, 8);

assert_eq!(&bytes, b"Hello, Wello!");

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

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

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!

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

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

Transmute the slice to a slice of another type, ensuring alignment 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 part will be as big as possible under the given alignment constraint and element size.

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.

Safety

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

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

Transmute the mutable slice to a mutable slice of another type, ensuring alignment 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 part will be as big as possible under the given alignment constraint and element size.

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.

Safety

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

pub fn as_simd<const LANES: usize>(&self) -> (&[T], &[Simd<T, LANES>], &[T])

where Simd<T, LANES>: AsRef<[T; LANES]>, T: SimdElement, LaneCount<LANES>: SupportedLaneCount,

🔬This is a nightly-only experimental API. (portable_simd)

Split a slice into a prefix, a middle of aligned SIMD types, and a suffix.

This is a safe wrapper around slice::align_to, so has the same weak postconditions as that method. You’re only assured that self.len() == prefix.len() + middle.len() * LANES + suffix.len().

Notably, all of the following are possible:

• prefix.len() >= LANES.
• middle.is_empty() despite self.len() >= 3 * LANES.
• suffix.len() >= LANES.

That said, this is a safe method, so if you’re only writing safe code, then this can at most cause incorrect logic, not unsoundness.

Panics

This will panic if the size of the SIMD type is different from LANES times that of the scalar.

At the time of writing, the trait restrictions on Simd<T, LANES> keeps that from ever happening, as only power-of-two numbers of lanes are supported. It’s possible that, in the future, those restrictions might be lifted in a way that would make it possible to see panics from this method for something like LANES == 3.

Examples

#![feature(portable_simd)]
use core::simd::prelude::*;

let short = &[1, 2, 3];
let (prefix, middle, suffix) = short.as_simd::<4>();
assert_eq!(middle, []); // Not enough elements for anything in the middle

// They might be split in any possible way between prefix and suffix
let it = prefix.iter().chain(suffix).copied();
assert_eq!(it.collect::<Vec<_>>(), vec![1, 2, 3]);

fn basic_simd_sum(x: &[f32]) -> f32 {
    use std::ops::Add;
    let (prefix, middle, suffix) = x.as_simd();
    let sums = f32x4::from_array([
        prefix.iter().copied().sum(),
        0.0,
        0.0,
        suffix.iter().copied().sum(),
    ]);
    let sums = middle.iter().copied().fold(sums, f32x4::add);
    sums.reduce_sum()
}

let numbers: Vec<f32> = (1..101).map(|x| x as _).collect();
assert_eq!(basic_simd_sum(&numbers[1..99]), 4949.0);

pub fn as_simd_mut<const LANES: usize>( &mut self, ) -> (&mut [T], &mut [Simd<T, LANES>], &mut [T])

where Simd<T, LANES>: AsMut<[T; LANES]>, T: SimdElement, LaneCount<LANES>: SupportedLaneCount,

🔬This is a nightly-only experimental API. (portable_simd)

Split a mutable slice into a mutable prefix, a middle of aligned SIMD types, and a mutable suffix.

This is a safe wrapper around slice::align_to_mut, so has the same weak postconditions as that method. You’re only assured that self.len() == prefix.len() + middle.len() * LANES + suffix.len().

Notably, all of the following are possible:

• prefix.len() >= LANES.
• middle.is_empty() despite self.len() >= 3 * LANES.
• suffix.len() >= LANES.

That said, this is a safe method, so if you’re only writing safe code, then this can at most cause incorrect logic, not unsoundness.

This is the mutable version of slice::as_simd; see that for examples.

Panics

This will panic if the size of the SIMD type is different from LANES times that of the scalar.

At the time of writing, the trait restrictions on Simd<T, LANES> keeps that from ever happening, as only power-of-two numbers of lanes are supported. It’s possible that, in the future, those restrictions might be lifted in a way that would make it possible to see panics from this method for something like LANES == 3.

pub fn is_sorted(&self) -> bool

where T: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this slice are sorted.

That is, for each element a and its following element b, a <= b must hold. If the slice yields exactly zero or one element, true is returned.

Note that if Self::Item is only PartialOrd, but not Ord, the above definition implies that this function returns false if any two consecutive items are not comparable.

Examples

#![feature(is_sorted)]
let empty: [i32; 0] = [];

assert!([1, 2, 2, 9].is_sorted());
assert!(![1, 3, 2, 4].is_sorted());
assert!([0].is_sorted());
assert!(empty.is_sorted());
assert!(![0.0, 1.0, f32::NAN].is_sorted());

pub fn is_sorted_by<'a, F>(&'a self, compare: F) -> bool

where F: FnMut(&'a T, &'a T) -> bool,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this slice are sorted using the given comparator function.

Instead of using PartialOrd::partial_cmp, this function uses the given compare function to determine whether two elements are to be considered in sorted order.

Examples

#![feature(is_sorted)]

assert!([1, 2, 2, 9].is_sorted_by(|a, b| a <= b));
assert!(![1, 2, 2, 9].is_sorted_by(|a, b| a < b));

assert!([0].is_sorted_by(|a, b| true));
assert!([0].is_sorted_by(|a, b| false));

let empty: [i32; 0] = [];
assert!(empty.is_sorted_by(|a, b| false));
assert!(empty.is_sorted_by(|a, b| true));

pub fn is_sorted_by_key<'a, F, K>(&'a self, f: F) -> bool

where F: FnMut(&'a T) -> K, K: PartialOrd,

🔬This is a nightly-only experimental API. (is_sorted)

Checks if the elements of this slice are sorted using the given key extraction function.

Instead of comparing the slice’s elements directly, this function compares the keys of the elements, as determined by f. Apart from that, it’s equivalent to is_sorted; see its documentation for more information.

Examples

#![feature(is_sorted)]

assert!(["c", "bb", "aaa"].is_sorted_by_key(|s| s.len()));
assert!(![-2i32, -1, 0, 3].is_sorted_by_key(|n| n.abs()));

pub fn partition_point<P>(&self, pred: P) -> usize

where P: FnMut(&T) -> bool,

Returns the index of the partition point according to the given predicate (the index of the first element of the second partition).

The slice is assumed to be partitioned according to the given predicate. This means that all elements for which the predicate returns true are at the start of the slice and all elements for which the predicate returns false are at the end. For example, [7, 15, 3, 5, 4, 12, 6] is partitioned under the predicate x % 2 != 0 (all odd numbers are at the start, all even at the end).

If this slice is not partitioned, the returned result is unspecified and meaningless, as this method performs a kind of binary search.

See also binary_search, binary_search_by, and binary_search_by_key.

Examples

let v = [1, 2, 3, 3, 5, 6, 7];
let i = v.partition_point(|&x| x < 5);

assert_eq!(i, 4);
assert!(v[..i].iter().all(|&x| x < 5));
assert!(v[i..].iter().all(|&x| !(x < 5)));

If all elements of the slice match the predicate, including if the slice is empty, then the length of the slice will be returned:

let a = [2, 4, 8];
assert_eq!(a.partition_point(|x| x < &100), a.len());
let a: [i32; 0] = [];
assert_eq!(a.partition_point(|x| x < &100), 0);

If you want to insert an item to a sorted vector, while maintaining sort order:

let mut s = vec![0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55];
let num = 42;
let idx = s.partition_point(|&x| x <= num);
s.insert(idx, num);
assert_eq!(s, [0, 1, 1, 1, 1, 2, 3, 5, 8, 13, 21, 34, 42, 55]);

pub fn take<'a, R>(self: &mut &'a [T], range: R) -> Option<&'a [T]>

where R: OneSidedRange<usize>,

🔬This is a nightly-only experimental API. (slice_take)

Removes the subslice corresponding to the given range and returns a reference to it.

Returns None and does not modify the slice if the given range is out of bounds.

Note that this method only accepts one-sided ranges such as 2.. or ..6, but not 2..6.

Examples

Taking the first three elements of a slice:

#![feature(slice_take)]

let mut slice: &[_] = &['a', 'b', 'c', 'd'];
let mut first_three = slice.take(..3).unwrap();

assert_eq!(slice, &['d']);
assert_eq!(first_three, &['a', 'b', 'c']);

Taking the last two elements of a slice:

#![feature(slice_take)]

let mut slice: &[_] = &['a', 'b', 'c', 'd'];
let mut tail = slice.take(2..).unwrap();

assert_eq!(slice, &['a', 'b']);
assert_eq!(tail, &['c', 'd']);

Getting None when range is out of bounds:

#![feature(slice_take)]

let mut slice: &[_] = &['a', 'b', 'c', 'd'];

assert_eq!(None, slice.take(5..));
assert_eq!(None, slice.take(..5));
assert_eq!(None, slice.take(..=4));
let expected: &[char] = &['a', 'b', 'c', 'd'];
assert_eq!(Some(expected), slice.take(..4));

pub fn take_mut<'a, R>(self: &mut &'a mut [T], range: R) -> Option<&'a mut [T]>

where R: OneSidedRange<usize>,

🔬This is a nightly-only experimental API. (slice_take)

Removes the subslice corresponding to the given range and returns a mutable reference to it.

Returns None and does not modify the slice if the given range is out of bounds.

Note that this method only accepts one-sided ranges such as 2.. or ..6, but not 2..6.

Examples

Taking the first three elements of a slice:

#![feature(slice_take)]

let mut slice: &mut [_] = &mut ['a', 'b', 'c', 'd'];
let mut first_three = slice.take_mut(..3).unwrap();

assert_eq!(slice, &mut ['d']);
assert_eq!(first_three, &mut ['a', 'b', 'c']);

Taking the last two elements of a slice:

#![feature(slice_take)]

let mut slice: &mut [_] = &mut ['a', 'b', 'c', 'd'];
let mut tail = slice.take_mut(2..).unwrap();

assert_eq!(slice, &mut ['a', 'b']);
assert_eq!(tail, &mut ['c', 'd']);

Getting None when range is out of bounds:

#![feature(slice_take)]

let mut slice: &mut [_] = &mut ['a', 'b', 'c', 'd'];

assert_eq!(None, slice.take_mut(5..));
assert_eq!(None, slice.take_mut(..5));
assert_eq!(None, slice.take_mut(..=4));
let expected: &mut [_] = &mut ['a', 'b', 'c', 'd'];
assert_eq!(Some(expected), slice.take_mut(..4));

pub fn take_first<'a>(self: &mut &'a [T]) -> Option<&'a T>

🔬This is a nightly-only experimental API. (slice_take)

Removes the first element of the slice and returns a reference to it.

Returns None if the slice is empty.

Examples

#![feature(slice_take)]

let mut slice: &[_] = &['a', 'b', 'c'];
let first = slice.take_first().unwrap();

assert_eq!(slice, &['b', 'c']);
assert_eq!(first, &'a');

pub fn take_first_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

🔬This is a nightly-only experimental API. (slice_take)

Removes the first element of the slice and returns a mutable reference to it.

Returns None if the slice is empty.

Examples

#![feature(slice_take)]

let mut slice: &mut [_] = &mut ['a', 'b', 'c'];
let first = slice.take_first_mut().unwrap();
*first = 'd';

assert_eq!(slice, &['b', 'c']);
assert_eq!(first, &'d');

pub fn take_last<'a>(self: &mut &'a [T]) -> Option<&'a T>

🔬This is a nightly-only experimental API. (slice_take)

Removes the last element of the slice and returns a reference to it.

Returns None if the slice is empty.

Examples

#![feature(slice_take)]

let mut slice: &[_] = &['a', 'b', 'c'];
let last = slice.take_last().unwrap();

assert_eq!(slice, &['a', 'b']);
assert_eq!(last, &'c');

pub fn take_last_mut<'a>(self: &mut &'a mut [T]) -> Option<&'a mut T>

🔬This is a nightly-only experimental API. (slice_take)

Removes the last element of the slice and returns a mutable reference to it.

Returns None if the slice is empty.

Examples

#![feature(slice_take)]

let mut slice: &mut [_] = &mut ['a', 'b', 'c'];
let last = slice.take_last_mut().unwrap();
*last = 'd';

assert_eq!(slice, &['a', 'b']);
assert_eq!(last, &'d');

pub unsafe fn get_many_unchecked_mut<const N: usize>( &mut self, indices: [usize; N], ) -> [&mut T; N]

🔬This is a nightly-only experimental API. (get_many_mut)

Returns mutable references to many indices at once, without doing any checks.

For a safe alternative see get_many_mut.

Safety

Calling this method with overlapping or out-of-bounds indices is undefined behavior even if the resulting references are not used.

Examples

#![feature(get_many_mut)]

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

unsafe {
    let [a, b] = x.get_many_unchecked_mut([0, 2]);
    *a *= 10;
    *b *= 100;
}
assert_eq!(x, &[10, 2, 400]);

pub fn get_many_mut<const N: usize>( &mut self, indices: [usize; N], ) -> Result<[&mut T; N], GetManyMutError<N>>

🔬This is a nightly-only experimental API. (get_many_mut)

Returns mutable references to many indices at once.

Returns an error if any index is out-of-bounds, or if the same index was passed more than once.

Examples

#![feature(get_many_mut)]

let v = &mut [1, 2, 3];
if let Ok([a, b]) = v.get_many_mut([0, 2]) {
    *a = 413;
    *b = 612;
}
assert_eq!(v, &[413, 2, 612]);

pub fn sort_floats(&mut self)

🔬This is a nightly-only experimental API. (sort_floats)

Sorts the slice of floats.

This sort is in-place (i.e. does not allocate), O(n * log(n)) worst-case, and uses the ordering defined by f32::total_cmp.

Current implementation

This uses the same sorting algorithm as sort_unstable_by.

Examples

#![feature(sort_floats)]
let mut v = [2.6, -5e-8, f32::NAN, 8.29, f32::INFINITY, -1.0, 0.0, -f32::INFINITY, -0.0];

v.sort_floats();
let sorted = [-f32::INFINITY, -1.0, -5e-8, -0.0, 0.0, 2.6, 8.29, f32::INFINITY, f32::NAN];
assert_eq!(&v[..8], &sorted[..8]);
assert!(v[8].is_nan());

pub fn sort_floats(&mut self)

🔬This is a nightly-only experimental API. (sort_floats)

Sorts the slice of floats.

This sort is in-place (i.e. does not allocate), O(n * log(n)) worst-case, and uses the ordering defined by f64::total_cmp.

Current implementation

This uses the same sorting algorithm as sort_unstable_by.

Examples

#![feature(sort_floats)]
let mut v = [2.6, -5e-8, f64::NAN, 8.29, f64::INFINITY, -1.0, 0.0, -f64::INFINITY, -0.0];

v.sort_floats();
let sorted = [-f64::INFINITY, -1.0, -5e-8, -0.0, 0.0, 2.6, 8.29, f64::INFINITY, f64::NAN];
assert_eq!(&v[..8], &sorted[..8]);
assert!(v[8].is_nan());

pub fn is_ascii(&self) -> bool

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

pub fn as_ascii(&self) -> Option<&[AsciiChar]>

🔬This is a nightly-only experimental API. (ascii_char)

If this slice is_ascii, returns it as a slice of ASCII characters, otherwise returns None.

pub unsafe fn as_ascii_unchecked(&self) -> &[AsciiChar]

🔬This is a nightly-only experimental API. (ascii_char)

Converts this slice of bytes into a slice of ASCII characters, without checking whether they’re valid.

Safety

Every byte in the slice must be in 0..=127, or else this is UB.

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

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)

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)

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.

pub fn escape_ascii(&self) -> EscapeAscii<'_>

Returns an iterator that produces an escaped version of this slice, treating it as an ASCII string.

Examples

let s = b"0\t\r\n'\"\\\x9d";
let escaped = s.escape_ascii().to_string();
assert_eq!(escaped, "0\\t\\r\\n\\'\\\"\\\\\\x9d");

pub fn trim_ascii_start(&self) -> &[u8]

Returns a byte slice with leading ASCII whitespace bytes removed.

‘Whitespace’ refers to the definition used by u8::is_ascii_whitespace.

Examples

assert_eq!(b" \t hello world\n".trim_ascii_start(), b"hello world\n");
assert_eq!(b"  ".trim_ascii_start(), b"");
assert_eq!(b"".trim_ascii_start(), b"");

pub fn trim_ascii_end(&self) -> &[u8]

Returns a byte slice with trailing ASCII whitespace bytes removed.

‘Whitespace’ refers to the definition used by u8::is_ascii_whitespace.

Examples

assert_eq!(b"\r hello world\n ".trim_ascii_end(), b"\r hello world");
assert_eq!(b"  ".trim_ascii_end(), b"");
assert_eq!(b"".trim_ascii_end(), b"");

pub fn trim_ascii(&self) -> &[u8]

Returns a byte slice with leading and trailing ASCII whitespace bytes removed.

‘Whitespace’ refers to the definition used by u8::is_ascii_whitespace.

Examples

assert_eq!(b"\r hello world\n ".trim_ascii(), b"hello world");
assert_eq!(b"  ".trim_ascii(), b"");
assert_eq!(b"".trim_ascii(), b"");

pub fn as_str(&self) -> &str

🔬This is a nightly-only experimental API. (ascii_char)

Views this slice of ASCII characters as a UTF-8 str.

pub fn as_bytes(&self) -> &[u8]

🔬This is a nightly-only experimental API. (ascii_char)

Views this slice of ASCII characters as a slice of u8 bytes.

pub fn utf8_chunks(&self) -> Utf8Chunks<'_>

Creates an iterator over the contiguous valid UTF-8 ranges of this slice, and the non-UTF-8 fragments in between.

Examples

This function formats arbitrary but mostly-UTF-8 bytes into Rust source code in the form of a C-string literal (c"...").

use std::fmt::Write as _;

pub fn cstr_literal(bytes: &[u8]) -> String {
    let mut repr = String::new();
    repr.push_str("c\"");
    for chunk in bytes.utf8_chunks() {
        for ch in chunk.valid().chars() {
            // Escapes \0, \t, \r, \n, \\, \', \", and uses \u{...} for non-printable characters.
            write!(repr, "{}", ch.escape_debug()).unwrap();
        }
        for byte in chunk.invalid() {
            write!(repr, "\\x{:02X}", byte).unwrap();
        }
    }
    repr.push('"');
    repr
}

fn main() {
    let lit = cstr_literal(b"\xferris the \xf0\x9f\xa6\x80\x07");
    let expected = stringify!(c"\xFErris the 🦀\u{7}");
    assert_eq!(lit, expected);
}

pub fn sort(&mut self)

where T: Ord,

Sorts the slice, preserving initial order of equal elements.

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

If T: Ord does not implement a total order the resulting order is unspecified. All original elements will remain in the slice and any possible modifications via interior mutability are observed in the input. Same is true if T: Ord panics.

When applicable, unstable sorting is preferred because it is generally faster than stable sorting and it doesn’t allocate auxiliary memory. See sort_unstable. The exception are partially sorted slices, which may be better served with slice::sort.

Current implementation

The current implementation is based on driftsort by Orson Peters and Lukas Bergdoll, which combines the fast average case of quicksort with the fast worst case and partial run detection of mergesort, achieving linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the expected time to sort the data is O(n * log(k)).

The auxiliary memory allocation behavior depends on the input length. Short slices are handled without allocation, medium sized slices allocate self.len() and beyond that it clamps at self.len() / 2.

If T: Ord does not implement a total order, the implementation may panic.

Examples

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

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

pub fn sort_by<F>(&mut self, compare: F)

where F: FnMut(&T, &T) -> Ordering,

Sorts the slice with a comparator function, preserving initial order of equal elements.

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

The comparator function should define a total ordering for the elements in the slice. If the ordering is not total, the order of the elements is unspecified.

If the comparator function does not implement a total order the resulting order is unspecified. All original elements will remain in the slice and any possible modifications via interior mutability are observed in the input. Same is true if the comparator function panics. A total order (for all a, b and c):

• total and antisymmetric: exactly one of a < b, a == b or a > b is true, and
• transitive, a < b and b < c implies a < c. The same must hold for both == and >.

For example, while f64 doesn’t implement Ord because NaN != NaN, we can use partial_cmp as our sort function when we know the slice doesn’t contain a NaN.

let mut floats = [5f64, 4.0, 1.0, 3.0, 2.0];
floats.sort_unstable_by(|a, b| a.partial_cmp(b).unwrap());
assert_eq!(floats, [1.0, 2.0, 3.0, 4.0, 5.0]);

Current implementation

The current implementation is based on driftsort by Orson Peters and Lukas Bergdoll, which combines the fast average case of quicksort with the fast worst case and partial run detection of mergesort, achieving linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the expected time to sort the data is O(n * log(k)).

The auxiliary memory allocation behavior depends on the input length. Short slices are handled without allocation, medium sized slices allocate self.len() and beyond that it clamps at self.len() / 2.

If T: Ord does not implement a total order, the implementation may panic.

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

pub fn sort_by_key<K, F>(&mut self, f: F)

where F: FnMut(&T) -> K, K: Ord,

Sorts the slice with a key extraction function, preserving initial order of equal elements.

This sort is stable (i.e., does not reorder equal elements) and O(m * n * log(n)) worst-case, where the key function is O(m).

If K: Ord does not implement a total order the resulting order is unspecified. All original elements will remain in the slice and any possible modifications via interior mutability are observed in the input. Same is true if K: Ord panics.

Current implementation

The current implementation is based on driftsort by Orson Peters and Lukas Bergdoll, which combines the fast average case of quicksort with the fast worst case and partial run detection of mergesort, achieving linear time on fully sorted and reversed inputs. On inputs with k distinct elements, the expected time to sort the data is O(n * log(k)).

The auxiliary memory allocation behavior depends on the input length. Short slices are handled without allocation, medium sized slices allocate self.len() and beyond that it clamps at self.len() / 2.

If K: Ord does not implement a total order, the implementation may panic.

Examples

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

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

pub fn sort_by_cached_key<K, F>(&mut self, f: F)

where F: FnMut(&T) -> K, K: Ord,

Sorts the slice with a key extraction function, preserving initial order of equal elements.

This sort is stable (i.e., does not reorder equal elements) and O(m * n + n * log(n)) worst-case, where the key function is O(m).

During sorting, the key function is called at most once per element, by using temporary storage to remember the results of key evaluation. The order of calls to the key function is unspecified and may change in future versions of the standard library.

If K: Ord does not implement a total order the resulting order is unspecified. All original elements will remain in the slice and any possible modifications via interior mutability are observed in the input. Same is true if K: Ord panics.

For simple key functions (e.g., functions that are property accesses or basic operations), sort_by_key is likely to be faster.

Current implementation

The current implementation is based on instruction-parallel-network sort by Lukas Bergdoll, which combines the fast average case of randomized quicksort with the fast worst case of heapsort, while achieving linear time on fully sorted and reversed inputs. And O(k * log(n)) where k is the number of distinct elements in the input. It leverages superscalar out-of-order execution capabilities commonly found in CPUs, to efficiently perform the operation.

In the worst case, the algorithm allocates temporary storage in a Vec<(K, usize)> the length of the slice.

Examples

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

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

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

pub fn to_vec_in<A>(&self, alloc: A) -> Vec<T, A>

where A: Allocator, T: Clone,

🔬This is a nightly-only experimental API. (allocator_api)

Copies self into a new Vec with an allocator.

Examples

#![feature(allocator_api)]

use std::alloc::System;

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

pub fn repeat(&self, n: usize) -> Vec<T>

where T: Copy,

Creates a vector by copying a slice n times.

Panics

This function will panic if the capacity would overflow.

Examples

Basic usage:

assert_eq!([1, 2].repeat(3), vec![1, 2, 1, 2, 1, 2]);

A panic upon overflow:

// this will panic at runtime
b"0123456789abcdef".repeat(usize::MAX);

pub fn concat<Item>(&self) -> <[T] as Concat<Item>>::Output

where [T]: Concat<Item>, Item: ?Sized,

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

Examples

assert_eq!(["hello", "world"].concat(), "helloworld");
assert_eq!([[1, 2], [3, 4]].concat(), [1, 2, 3, 4]);

pub fn join<Separator>( &self, sep: Separator, ) -> <[T] as Join<Separator>>::Output

where [T]: Join<Separator>,

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

Examples

assert_eq!(["hello", "world"].join(" "), "hello world");
assert_eq!([[1, 2], [3, 4]].join(&0), [1, 2, 0, 3, 4]);
assert_eq!([[1, 2], [3, 4]].join(&[0, 0][..]), [1, 2, 0, 0, 3, 4]);

pub fn connect<Separator>( &self, sep: Separator, ) -> <[T] as Join<Separator>>::Output

where [T]: Join<Separator>,

👎Deprecated since 1.3.0: renamed to join

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

Examples

assert_eq!(["hello", "world"].connect(" "), "hello world");
assert_eq!([[1, 2], [3, 4]].connect(&0), [1, 2, 0, 3, 4]);

pub fn to_ascii_uppercase(&self) -> Vec<u8>

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

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

To uppercase the value in-place, use make_ascii_uppercase.

pub fn to_ascii_lowercase(&self) -> Vec<u8>

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

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

To lowercase the value in-place, use make_ascii_lowercase.

Trait Implementations

impl<T> AbsDiffEq for Rgb<T>

where T: AbsDiffEq, <T as AbsDiffEq>::Epsilon: Copy,

type Epsilon = <T as AbsDiffEq>::Epsilon

Used for specifying relative comparisons.

fn default_epsilon() -> <T as AbsDiffEq>::Epsilon

The default tolerance to use when testing values that are close together.

fn abs_diff_eq( &self, other: &Rgb<T>, epsilon: <Rgb<T> as AbsDiffEq>::Epsilon, ) -> bool

A test for equality that uses the absolute difference to compute the approximate equality of two numbers.

fn abs_diff_ne(&self, other: &Rhs, epsilon: Self::Epsilon) -> bool

The inverse of [AbsDiffEq::abs_diff_eq].

impl<'a, 'b, T> Add<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: Add<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the + operator.

fn add(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as Add<&'a Rgb<T>>>::Output

Performs the + operation.

impl<'a, T> Add<&'a Rgb<T>> for Rgb<T>

where T: Add<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the + operator.

fn add(self, rhs: &'a Rgb<T>) -> <Rgb<T> as Add<&'a Rgb<T>>>::Output

Performs the + operation.

impl<'a, 'b, T> Add<&'a T> for &'b Rgb<T>

where &'b T: Add<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the + operator.

fn add(self, rhs: &'a T) -> <&'b Rgb<T> as Add<&'a T>>::Output

Performs the + operation.

impl<'a, T> Add<Rgb<T>> for &'a Rgb<T>

where &'a T: Add<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the + operator.

fn add(self, rhs: Rgb<T>) -> <&'a Rgb<T> as Add<Rgb<T>>>::Output

Performs the + operation.

impl Add<Rgb<i64>> for i64

type Output = Rgb<i64>

The resulting type after applying the + operator.

fn add(self, rhs: Rgb<i64>) -> <i64 as Add<Rgb<i64>>>::Output

Performs the + operation.

impl Add<Rgb<u32>> for u32

type Output = Rgb<u32>

The resulting type after applying the + operator.

fn add(self, rhs: Rgb<u32>) -> <u32 as Add<Rgb<u32>>>::Output

Performs the + operation.

impl<'a, T> Add<T> for &'a Rgb<T>

where &'a T: Add<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the + operator.

fn add(self, rhs: T) -> <&'a Rgb<T> as Add<T>>::Output

Performs the + operation.

impl<V, T> Add<V> for Rgb<T>

where V: Into<Rgb<T>>, T: Add<Output = T>,

type Output = Rgb<T>

The resulting type after applying the + operator.

fn add(self, rhs: V) -> <Rgb<T> as Add<V>>::Output

Performs the + operation.

impl<V, T> AddAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: AddAssign,

fn add_assign(&mut self, rhs: V)

Performs the += operation.

impl<T> AsMut<[T]> for Rgb<T>

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

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T> AsMut<Rgb<T>> for Rgb<T>

fn as_mut(&mut self) -> &mut Rgb<T>

Converts this type into a mutable reference of the (usually inferred) input type.

impl<T> AsRef<[T]> for Rgb<T>

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

Converts this type into a shared reference of the (usually inferred) input type.

impl<T> AsRef<Rgb<T>> for Rgb<T>

fn as_ref(&self) -> &Rgb<T>

Converts this type into a shared reference of the (usually inferred) input type.

impl<'a, 'b, T> BitAnd<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: BitAnd<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as BitAnd<&'a Rgb<T>>>::Output

Performs the & operation.

impl<'a, T> BitAnd<&'a Rgb<T>> for Rgb<T>

where T: BitAnd<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a Rgb<T>) -> <Rgb<T> as BitAnd<&'a Rgb<T>>>::Output

Performs the & operation.

impl<'a, 'b, T> BitAnd<&'a T> for &'b Rgb<T>

where &'b T: BitAnd<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: &'a T) -> <&'b Rgb<T> as BitAnd<&'a T>>::Output

Performs the & operation.

impl<'a, T> BitAnd<Rgb<T>> for &'a Rgb<T>

where &'a T: BitAnd<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: Rgb<T>) -> <&'a Rgb<T> as BitAnd<Rgb<T>>>::Output

Performs the & operation.

impl<'a, T> BitAnd<T> for &'a Rgb<T>

where &'a T: BitAnd<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: T) -> <&'a Rgb<T> as BitAnd<T>>::Output

Performs the & operation.

impl<V, T> BitAnd<V> for Rgb<T>

where V: Into<Rgb<T>>, T: BitAnd<Output = T>,

type Output = Rgb<T>

The resulting type after applying the & operator.

fn bitand(self, rhs: V) -> <Rgb<T> as BitAnd<V>>::Output

Performs the & operation.

impl<V, T> BitAndAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: BitAndAssign,

fn bitand_assign(&mut self, rhs: V)

Performs the &= operation.

impl<'a, 'b, T> BitOr<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: BitOr<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as BitOr<&'a Rgb<T>>>::Output

Performs the | operation.

impl<'a, T> BitOr<&'a Rgb<T>> for Rgb<T>

where T: BitOr<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a Rgb<T>) -> <Rgb<T> as BitOr<&'a Rgb<T>>>::Output

Performs the | operation.

impl<'a, 'b, T> BitOr<&'a T> for &'b Rgb<T>

where &'b T: BitOr<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: &'a T) -> <&'b Rgb<T> as BitOr<&'a T>>::Output

Performs the | operation.

impl<'a, T> BitOr<Rgb<T>> for &'a Rgb<T>

where &'a T: BitOr<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: Rgb<T>) -> <&'a Rgb<T> as BitOr<Rgb<T>>>::Output

Performs the | operation.

impl<'a, T> BitOr<T> for &'a Rgb<T>

where &'a T: BitOr<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: T) -> <&'a Rgb<T> as BitOr<T>>::Output

Performs the | operation.

impl<V, T> BitOr<V> for Rgb<T>

where V: Into<Rgb<T>>, T: BitOr<Output = T>,

type Output = Rgb<T>

The resulting type after applying the | operator.

fn bitor(self, rhs: V) -> <Rgb<T> as BitOr<V>>::Output

Performs the | operation.

impl<V, T> BitOrAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: BitOrAssign,

fn bitor_assign(&mut self, rhs: V)

Performs the |= operation.

impl<'a, 'b, T> BitXor<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: BitXor<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as BitXor<&'a Rgb<T>>>::Output

Performs the ^ operation.

impl<'a, T> BitXor<&'a Rgb<T>> for Rgb<T>

where T: BitXor<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a Rgb<T>) -> <Rgb<T> as BitXor<&'a Rgb<T>>>::Output

Performs the ^ operation.

impl<'a, 'b, T> BitXor<&'a T> for &'b Rgb<T>

where &'b T: BitXor<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: &'a T) -> <&'b Rgb<T> as BitXor<&'a T>>::Output

Performs the ^ operation.

impl<'a, T> BitXor<Rgb<T>> for &'a Rgb<T>

where &'a T: BitXor<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: Rgb<T>) -> <&'a Rgb<T> as BitXor<Rgb<T>>>::Output

Performs the ^ operation.

impl<'a, T> BitXor<T> for &'a Rgb<T>

where &'a T: BitXor<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: T) -> <&'a Rgb<T> as BitXor<T>>::Output

Performs the ^ operation.

impl<V, T> BitXor<V> for Rgb<T>

where V: Into<Rgb<T>>, T: BitXor<Output = T>,

type Output = Rgb<T>

The resulting type after applying the ^ operator.

fn bitxor(self, rhs: V) -> <Rgb<T> as BitXor<V>>::Output

Performs the ^ operation.

impl<V, T> BitXorAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: BitXorAssign,

fn bitxor_assign(&mut self, rhs: V)

Performs the ^= operation.

impl<T> Borrow<[T]> for Rgb<T>

fn borrow(&self) -> &[T]

Immutably borrows from an owned value.

impl<T> BorrowMut<[T]> for Rgb<T>

fn borrow_mut(&mut self) -> &mut [T]

Mutably borrows from an owned value.

impl<T> CheckedAdd for Rgb<T>

where T: CheckedAdd,

fn checked_add(&self, v: &Rgb<T>) -> Option<Rgb<T>>

Adds two numbers, checking for overflow. If overflow happens, None is returned.

impl<T> CheckedDiv for Rgb<T>

where T: CheckedDiv,

fn checked_div(&self, v: &Rgb<T>) -> Option<Rgb<T>>

Divides two numbers, checking for underflow, overflow and division by zero. If any of that happens, None is returned.

impl<T> CheckedEuclid for Rgb<T>

where T: CheckedEuclid,

fn checked_div_euclid(&self, v: &Rgb<T>) -> Option<Rgb<T>>

Performs euclid division that returns None instead of panicking on division by zero and instead of wrapping around on underflow and overflow.

fn checked_rem_euclid(&self, v: &Rgb<T>) -> Option<Rgb<T>>

Finds the euclid remainder of dividing two numbers, checking for underflow, overflow and division by zero. If any of that happens, None is returned.

fn checked_div_rem_euclid(&self, v: &Self) -> Option<(Self, Self)>

Returns both the quotient and remainder from checked Euclidean division.

impl<T> CheckedMul for Rgb<T>

where T: CheckedMul,

fn checked_mul(&self, v: &Rgb<T>) -> Option<Rgb<T>>

Multiplies two numbers, checking for underflow or overflow. If underflow or overflow happens, None is returned.

impl<T> CheckedNeg for Rgb<T>

where T: CheckedNeg,

fn checked_neg(&self) -> Option<Rgb<T>>

Negates a number, returning None for results that can’t be represented, like signed MIN values that can’t be positive, or non-zero unsigned values that can’t be negative.

impl<T> CheckedRem for Rgb<T>

where T: CheckedRem,

fn checked_rem(&self, v: &Rgb<T>) -> Option<Rgb<T>>

Finds the remainder of dividing two numbers, checking for underflow, overflow and division by zero. If any of that happens, None is returned.

impl<T> CheckedSub for Rgb<T>

where T: CheckedSub,

fn checked_sub(&self, v: &Rgb<T>) -> Option<Rgb<T>>

Subtracts two numbers, checking for underflow. If underflow happens, None is returned.

impl<T> Clamp<T> for Rgb<T>

where T: Clamp + Copy,

fn clamped(self, lower: T, upper: T) -> Rgb<T>

Constrains this value to be between lower and upper (inclusive).

fn clamped_to_inclusive_range(self, range: RangeInclusive<Bound>) -> Self

Alias to clamped, which accepts a RangeInclusive parameter instead of two values.

fn clamp(val: Self, lower: Bound, upper: Bound) -> Self

Alias to clamped, which doesn’t take self.

fn clamp_to_inclusive_range(val: Self, range: RangeInclusive<Bound>) -> Self

Alias to clamp, which accepts a RangeInclusive parameter instead of two values.

impl<T> Clamp for Rgb<T>

where T: Clamp,

fn clamped(self, lower: Rgb<T>, upper: Rgb<T>) -> Rgb<T>

Constrains this value to be between lower and upper (inclusive).

fn clamped_to_inclusive_range(self, range: RangeInclusive<Bound>) -> Self

Alias to clamped, which accepts a RangeInclusive parameter instead of two values.

fn clamp(val: Self, lower: Bound, upper: Bound) -> Self

Alias to clamped, which doesn’t take self.

fn clamp_to_inclusive_range(val: Self, range: RangeInclusive<Bound>) -> Self

Alias to clamp, which accepts a RangeInclusive parameter instead of two values.

impl<T> Clone for Rgb<T>

where T: Clone,

fn clone(&self) -> Rgb<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T> Debug for Rgb<T>

where T: Debug,

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

Formats the value using the given formatter.

impl<T> Default for Rgb<T>

where T: Default,

fn default() -> Rgb<T>

Returns the “default value” for a type.

impl<T> DerefMut for Rgb<T>

fn deref_mut(&mut self) -> &mut [T]

Mutably dereferences the value.

impl<'de, T> Deserialize<'de> for Rgb<T>

where T: Deserialize<'de>,

fn deserialize<__D>( __deserializer: __D, ) -> Result<Rgb<T>, <__D as Deserializer<'de>>::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Display for Rgb<T>

where T: Display,

Displays the vector, formatted as rgb({...}, {...}, {...}) where ... are the actual formatting parameters.

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

Formats the value using the given formatter.

impl<'a, 'b, T> Div<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: Div<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the / operator.

fn div(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as Div<&'a Rgb<T>>>::Output

Performs the / operation.

impl<'a, T> Div<&'a Rgb<T>> for Rgb<T>

where T: Div<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the / operator.

fn div(self, rhs: &'a Rgb<T>) -> <Rgb<T> as Div<&'a Rgb<T>>>::Output

Performs the / operation.

impl<'a, 'b, T> Div<&'a T> for &'b Rgb<T>

where &'b T: Div<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the / operator.

fn div(self, rhs: &'a T) -> <&'b Rgb<T> as Div<&'a T>>::Output

Performs the / operation.

impl<'a, T> Div<Rgb<T>> for &'a Rgb<T>

where &'a T: Div<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the / operator.

fn div(self, rhs: Rgb<T>) -> <&'a Rgb<T> as Div<Rgb<T>>>::Output

Performs the / operation.

impl<'a, T> Div<T> for &'a Rgb<T>

where &'a T: Div<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the / operator.

fn div(self, rhs: T) -> <&'a Rgb<T> as Div<T>>::Output

Performs the / operation.

impl<V, T> Div<V> for Rgb<T>

where V: Into<Rgb<T>>, T: Div<Output = T>,

type Output = Rgb<T>

The resulting type after applying the / operator.

fn div(self, rhs: V) -> <Rgb<T> as Div<V>>::Output

Performs the / operation.

impl<V, T> DivAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: DivAssign,

fn div_assign(&mut self, rhs: V)

Performs the /= operation.

impl<T> Euclid for Rgb<T>

where T: Euclid,

fn div_euclid(&self, v: &Rgb<T>) -> Rgb<T>

Calculates Euclidean division, the matching method for rem_euclid.

fn rem_euclid(&self, v: &Rgb<T>) -> Rgb<T>

Calculates the least nonnegative remainder of self (mod v).

fn div_rem_euclid(&self, v: &Self) -> (Self, Self)

Returns both the quotient and remainder from Euclidean division.

impl<T> From<[T; 3]> for Rgb<T>

fn from(array: [T; 3]) -> Rgb<T>

Converts to this type from the input type.

impl<T> From<(T, T, T)> for Rgb<T>

fn from(tuple: (T, T, T)) -> Rgb<T>

Converts to this type from the input type.

impl<T> From<Rgb<T>> for Rgb<T>

fn from(v: Rgb<T>) -> Rgb<T>

Converts to this type from the input type.

impl<T> From<Rgb<T>> for Rgba<T>

where T: ColorComponent,

fn from(v: Rgb<T>) -> Rgba<T>

Converts to this type from the input type.

impl<T> From<Rgb<T>> for Vec3<T>

fn from(v: Rgb<T>) -> Vec3<T>

Converts to this type from the input type.

impl<T> From<Rgba<T>> for Rgb<T>

fn from(v: Rgba<T>) -> Rgb<T>

Converts to this type from the input type.

impl<T> From<T> for Rgb<T>

where T: Copy,

A vector can be obtained from a single scalar by broadcasting it.

This conversion is important because it allows scalars to be smoothly accepted as operands in most vector operations.

For instance :

assert_eq!(Vec4::min(4, 5), Vec4::broadcast(4));
assert_eq!(Vec4::max(4, 5), Vec4::broadcast(5));
assert_eq!(Vec4::from(4), Vec4::broadcast(4));
assert_eq!(Vec4::from(4).mul_add(4, 5), Vec4::broadcast(21));

// scaling_3d() logically accepts a Vec3...
let _ = Mat4::<f32>::scaling_3d(Vec3::broadcast(5.0));
// ... but there you go; quick uniform scale, thanks to Into !
let _ = Mat4::scaling_3d(5_f32);

On the other hand, it also allows writing nonsense. To minimize surprises, the names of operations try to be as explicit as possible.

// This creates a matrix that translates to (5,5,5), but it's probably not what you meant.
// Hopefully the `_3d` suffix would help you catch this.
let _ = Mat4::translation_3d(5_f32);
// translation_3d() takes V: Into<Vec3> because it allows it to accept
// Vec2, Vec3 and Vec4, and also with both repr(C) and repr(simd) layouts.

fn from(val: T) -> Rgb<T>

Converts to this type from the input type.

impl<T> From<Vec3<T>> for Rgb<T>

fn from(v: Vec3<T>) -> Rgb<T>

Converts to this type from the input type.

impl<T> FromIterator<T> for Rgb<T>

where T: Default,

fn from_iter<I>(iter: I) -> Rgb<T>

where I: IntoIterator<Item = T>,

Creates a value from an iterator.

impl<T> Hash for Rgb<T>

where T: Hash,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<'a, T> IntoIterator for &'a Rgb<T>

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) -> <&'a Rgb<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<'a, T> IntoIterator for &'a mut Rgb<T>

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) -> <&'a mut Rgb<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> IntoIterator for Rgb<T>

type Item = T

The type of the elements being iterated over.

type IntoIter = IntoIter<T>

Which kind of iterator are we turning this into?

fn into_iter(self) -> <Rgb<T> as IntoIterator>::IntoIter

Creates an iterator from a value.

impl<T> Inv for Rgb<T>

where T: Inv<Output = T>,

type Output = Rgb<T>

The result after applying the operator.

fn inv(self) -> Rgb<T>

Returns the multiplicative inverse of self.

impl<T> IsBetween<T> for Rgb<T>

where T: IsBetween<Output = bool> + Copy,

type Output = Rgb<bool>

bool for scalars, or vector of bools for vectors.

fn is_between(self, lower: T, upper: T) -> <Rgb<T> as IsBetween<T>>::Output

Returns whether this value is between lower and upper (inclusive).

fn is_between_inclusive_range_bounds( self, range: RangeInclusive<Bound>, ) -> Self::Output

Returns whether this value is between the lower and upper bounds of this inclusive range. This is redundant with RangeInclusive::contains(), but is still useful for generics that use the IsBetween trait.

impl<T> IsBetween for Rgb<T>

where T: IsBetween<Output = bool>,

type Output = Rgb<bool>

bool for scalars, or vector of bools for vectors.

fn is_between( self, lower: Rgb<T>, upper: Rgb<T>, ) -> <Rgb<T> as IsBetween>::Output

Returns whether this value is between lower and upper (inclusive).

fn is_between_inclusive_range_bounds( self, range: RangeInclusive<Bound>, ) -> Self::Output

Returns whether this value is between the lower and upper bounds of this inclusive range. This is redundant with RangeInclusive::contains(), but is still useful for generics that use the IsBetween trait.

impl<'a, T, Factor> Lerp<Factor> for &'a Rgb<T>

where &'a T: Lerp<Factor, Output = T>, Factor: Copy,

type Output = Rgb<T>

The resulting type after performing the LERP operation.

fn lerp_unclamped_precise( from: &'a Rgb<T>, to: &'a Rgb<T>, factor: Factor, ) -> Rgb<T>

Returns the linear interpolation of from to to with factor unconstrained, using a possibly slower but more precise operation.

fn lerp_unclamped(from: &'a Rgb<T>, to: &'a Rgb<T>, factor: Factor) -> Rgb<T>

Returns the linear interpolation of from to to with factor unconstrained, using the supposedly fastest but less precise implementation.

fn lerp_unclamped_inclusive_range( range: RangeInclusive<Self>, factor: Factor, ) -> Self::Output

Version of lerp_unclamped() that used a single RangeInclusive parameter instead of two values.

fn lerp_unclamped_precise_inclusive_range( range: RangeInclusive<Self>, factor: Factor, ) -> Self::Output

Version of lerp_unclamped_precise() that used a single RangeInclusive parameter instead of two values.

impl<T, Factor> Lerp<Factor> for Rgb<T>

where T: Lerp<Factor, Output = T>, Factor: Copy,

type Output = Rgb<T>

The resulting type after performing the LERP operation.

fn lerp_unclamped_precise(from: Rgb<T>, to: Rgb<T>, factor: Factor) -> Rgb<T>

Returns the linear interpolation of from to to with factor unconstrained, using a possibly slower but more precise operation.

fn lerp_unclamped(from: Rgb<T>, to: Rgb<T>, factor: Factor) -> Rgb<T>

Returns the linear interpolation of from to to with factor unconstrained, using the supposedly fastest but less precise implementation.

fn lerp_unclamped_inclusive_range( range: RangeInclusive<Self>, factor: Factor, ) -> Self::Output

Version of lerp_unclamped() that used a single RangeInclusive parameter instead of two values.

fn lerp_unclamped_precise_inclusive_range( range: RangeInclusive<Self>, factor: Factor, ) -> Self::Output

Version of lerp_unclamped_precise() that used a single RangeInclusive parameter instead of two values.

impl<'a, 'b, T> Mul<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: Mul<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as Mul<&'a Rgb<T>>>::Output

Performs the * operation.

impl<'a, T> Mul<&'a Rgb<T>> for Rgb<T>

where T: Mul<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'a Rgb<T>) -> <Rgb<T> as Mul<&'a Rgb<T>>>::Output

Performs the * operation.

impl<'a, 'b, T> Mul<&'a T> for &'b Rgb<T>

where &'b T: Mul<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the * operator.

fn mul(self, rhs: &'a T) -> <&'b Rgb<T> as Mul<&'a T>>::Output

Performs the * operation.

impl<'a, T> Mul<Rgb<T>> for &'a Rgb<T>

where &'a T: Mul<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the * operator.

fn mul(self, rhs: Rgb<T>) -> <&'a Rgb<T> as Mul<Rgb<T>>>::Output

Performs the * operation.

impl Mul<Rgb<i64>> for i64

type Output = Rgb<i64>

The resulting type after applying the * operator.

fn mul(self, rhs: Rgb<i64>) -> <i64 as Mul<Rgb<i64>>>::Output

Performs the * operation.

impl Mul<Rgb<u32>> for u32

type Output = Rgb<u32>

The resulting type after applying the * operator.

fn mul(self, rhs: Rgb<u32>) -> <u32 as Mul<Rgb<u32>>>::Output

Performs the * operation.

impl<'a, T> Mul<T> for &'a Rgb<T>

where &'a T: Mul<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the * operator.

fn mul(self, rhs: T) -> <&'a Rgb<T> as Mul<T>>::Output

Performs the * operation.

impl<V, T> Mul<V> for Rgb<T>

where V: Into<Rgb<T>>, T: Mul<Output = T>,

type Output = Rgb<T>

The resulting type after applying the * operator.

fn mul(self, rhs: V) -> <Rgb<T> as Mul<V>>::Output

Performs the * operation.

impl<'a, T> MulAdd<&'a Rgb<T>> for Rgb<T>

where T: MulAdd<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add( self, a: &'a Rgb<T>, b: Rgb<T>, ) -> <Rgb<T> as MulAdd<&'a Rgb<T>>>::Output

Performs the fused multiply-add operation (self * a) + b

impl<'a, 'b, 'c, T> MulAdd<&'a Rgb<T>, &'b Rgb<T>> for &'c Rgb<T>

where &'c T: MulAdd<&'a T, &'b T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add( self, a: &'a Rgb<T>, b: &'b Rgb<T>, ) -> <&'c Rgb<T> as MulAdd<&'a Rgb<T>, &'b Rgb<T>>>::Output

Performs the fused multiply-add operation (self * a) + b

impl<'a, 'b, T> MulAdd<&'a Rgb<T>, &'b Rgb<T>> for Rgb<T>

where T: MulAdd<&'a T, &'b T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add( self, a: &'a Rgb<T>, b: &'b Rgb<T>, ) -> <Rgb<T> as MulAdd<&'a Rgb<T>, &'b Rgb<T>>>::Output

Performs the fused multiply-add operation (self * a) + b

impl<'a, 'c, T> MulAdd<&'a Rgb<T>, Rgb<T>> for &'c Rgb<T>

where &'c T: MulAdd<&'a T, T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add( self, a: &'a Rgb<T>, b: Rgb<T>, ) -> <&'c Rgb<T> as MulAdd<&'a Rgb<T>, Rgb<T>>>::Output

Performs the fused multiply-add operation (self * a) + b

impl<'b, 'c, T> MulAdd<Rgb<T>, &'b Rgb<T>> for &'c Rgb<T>

where &'c T: MulAdd<T, &'b T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add( self, a: Rgb<T>, b: &'b Rgb<T>, ) -> <&'c Rgb<T> as MulAdd<Rgb<T>, &'b Rgb<T>>>::Output

Performs the fused multiply-add operation (self * a) + b

impl<'b, T> MulAdd<Rgb<T>, &'b Rgb<T>> for Rgb<T>

where T: MulAdd<T, &'b T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add( self, a: Rgb<T>, b: &'b Rgb<T>, ) -> <Rgb<T> as MulAdd<Rgb<T>, &'b Rgb<T>>>::Output

Performs the fused multiply-add operation (self * a) + b

impl<'c, T> MulAdd<Rgb<T>, Rgb<T>> for &'c Rgb<T>

where &'c T: MulAdd<T, T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add( self, a: Rgb<T>, b: Rgb<T>, ) -> <&'c Rgb<T> as MulAdd<Rgb<T>, Rgb<T>>>::Output

Performs the fused multiply-add operation (self * a) + b

impl<T> MulAdd for Rgb<T>

where T: MulAdd<Output = T>,

type Output = Rgb<T>

The resulting type after applying the fused multiply-add.

fn mul_add(self, a: Rgb<T>, b: Rgb<T>) -> <Rgb<T> as MulAdd>::Output

Performs the fused multiply-add operation (self * a) + b

impl<V, T> MulAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: MulAssign,

fn mul_assign(&mut self, rhs: V)

Performs the *= operation.

impl<T> Neg for Rgb<T>

where T: Neg<Output = T>,

type Output = Rgb<T>

The resulting type after applying the - operator.

fn neg(self) -> <Rgb<T> as Neg>::Output

Performs the unary - operation.

impl<T> Not for Rgb<T>

where T: Not<Output = T>,

type Output = Rgb<T>

The resulting type after applying the ! operator.

fn not(self) -> <Rgb<T> as Not>::Output

Performs the unary ! operation.

impl<T> One for Rgb<T>

where T: One,

fn one() -> Rgb<T>

Returns the multiplicative identity element of Self, 1.

fn set_one(&mut self)

Sets self to the multiplicative identity element of Self, 1.

impl<T> OverflowingAdd for Rgb<T>

where T: OverflowingAdd,

fn overflowing_add(&self, v: &Rgb<T>) -> (Rgb<T>, bool)

Returns a tuple of the sum along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.

impl<T> OverflowingMul for Rgb<T>

where T: OverflowingMul,

fn overflowing_mul(&self, v: &Rgb<T>) -> (Rgb<T>, bool)

Returns a tuple of the product along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.

impl<T> OverflowingSub for Rgb<T>

where T: OverflowingSub,

fn overflowing_sub(&self, v: &Rgb<T>) -> (Rgb<T>, bool)

Returns a tuple of the difference along with a boolean indicating whether an arithmetic overflow would occur. If an overflow would have occurred then the wrapped value is returned.

impl<T> PartialEq for Rgb<T>

where T: PartialEq,

fn eq(&self, other: &Rgb<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Product for Rgb<T>

where T: Mul<Output = T> + One,

fn product<I>(iter: I) -> Rgb<T>

where I: Iterator<Item = Rgb<T>>,

Method which takes an iterator and generates Self from the elements by multiplying the items.

impl<T> RelativeEq for Rgb<T>

where T: RelativeEq, <T as AbsDiffEq>::Epsilon: Copy,

fn default_max_relative() -> <T as AbsDiffEq>::Epsilon

The default relative tolerance for testing values that are far-apart.

fn relative_eq( &self, other: &Rgb<T>, epsilon: <T as AbsDiffEq>::Epsilon, max_relative: <T as AbsDiffEq>::Epsilon, ) -> bool

A test for equality that uses a relative comparison if the values are far apart.

fn relative_ne( &self, other: &Rhs, epsilon: Self::Epsilon, max_relative: Self::Epsilon, ) -> bool

The inverse of [RelativeEq::relative_eq].

impl<'a, 'b, T> Rem<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: Rem<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the % operator.

fn rem(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as Rem<&'a Rgb<T>>>::Output

Performs the % operation.

impl<'a, T> Rem<&'a Rgb<T>> for Rgb<T>

where T: Rem<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the % operator.

fn rem(self, rhs: &'a Rgb<T>) -> <Rgb<T> as Rem<&'a Rgb<T>>>::Output

Performs the % operation.

impl<'a, 'b, T> Rem<&'a T> for &'b Rgb<T>

where &'b T: Rem<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the % operator.

fn rem(self, rhs: &'a T) -> <&'b Rgb<T> as Rem<&'a T>>::Output

Performs the % operation.

impl<'a, T> Rem<Rgb<T>> for &'a Rgb<T>

where &'a T: Rem<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the % operator.

fn rem(self, rhs: Rgb<T>) -> <&'a Rgb<T> as Rem<Rgb<T>>>::Output

Performs the % operation.

impl<'a, T> Rem<T> for &'a Rgb<T>

where &'a T: Rem<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the % operator.

fn rem(self, rhs: T) -> <&'a Rgb<T> as Rem<T>>::Output

Performs the % operation.

impl<V, T> Rem<V> for Rgb<T>

where V: Into<Rgb<T>>, T: Rem<Output = T>,

type Output = Rgb<T>

The resulting type after applying the % operator.

fn rem(self, rhs: V) -> <Rgb<T> as Rem<V>>::Output

Performs the % operation.

impl<V, T> RemAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: RemAssign,

fn rem_assign(&mut self, rhs: V)

Performs the %= operation.

impl<T> SaturatingAdd for Rgb<T>

where T: SaturatingAdd,

fn saturating_add(&self, v: &Rgb<T>) -> Rgb<T>

Saturating addition. Computes self + other, saturating at the relevant high or low boundary of the type.

impl<T> SaturatingMul for Rgb<T>

where T: SaturatingMul,

fn saturating_mul(&self, v: &Rgb<T>) -> Rgb<T>

Saturating multiplication. Computes self * other, saturating at the relevant high or low boundary of the type.

impl<T> SaturatingSub for Rgb<T>

where T: SaturatingSub,

fn saturating_sub(&self, v: &Rgb<T>) -> Rgb<T>

Saturating subtraction. Computes self - other, saturating at the relevant high or low boundary of the type.

impl<T> Serialize for Rgb<T>

where T: Serialize,

fn serialize<__S>( &self, __serializer: __S, ) -> Result<<__S as Serializer>::Ok, <__S as Serializer>::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl<'a, 'b, T> Shl<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: Shl<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the << operator.

fn shl(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as Shl<&'a Rgb<T>>>::Output

Performs the << operation.

impl<'a, T> Shl<&'a Rgb<T>> for Rgb<T>

where T: Shl<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the << operator.

fn shl(self, rhs: &'a Rgb<T>) -> <Rgb<T> as Shl<&'a Rgb<T>>>::Output

Performs the << operation.

impl<'a, 'b, T> Shl<&'a T> for &'b Rgb<T>

where &'b T: Shl<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the << operator.

fn shl(self, rhs: &'a T) -> <&'b Rgb<T> as Shl<&'a T>>::Output

Performs the << operation.

impl<'a, T> Shl<Rgb<T>> for &'a Rgb<T>

where &'a T: Shl<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the << operator.

fn shl(self, rhs: Rgb<T>) -> <&'a Rgb<T> as Shl<Rgb<T>>>::Output

Performs the << operation.

impl<'a, T> Shl<T> for &'a Rgb<T>

where &'a T: Shl<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the << operator.

fn shl(self, rhs: T) -> <&'a Rgb<T> as Shl<T>>::Output

Performs the << operation.

impl<V, T> Shl<V> for Rgb<T>

where V: Into<Rgb<T>>, T: Shl<Output = T>,

type Output = Rgb<T>

The resulting type after applying the << operator.

fn shl(self, rhs: V) -> <Rgb<T> as Shl<V>>::Output

Performs the << operation.

impl<V, T> ShlAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: ShlAssign,

fn shl_assign(&mut self, rhs: V)

Performs the <<= operation.

impl<'a, 'b, T> Shr<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: Shr<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the >> operator.

fn shr(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as Shr<&'a Rgb<T>>>::Output

Performs the >> operation.

impl<'a, T> Shr<&'a Rgb<T>> for Rgb<T>

where T: Shr<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the >> operator.

fn shr(self, rhs: &'a Rgb<T>) -> <Rgb<T> as Shr<&'a Rgb<T>>>::Output

Performs the >> operation.

impl<'a, 'b, T> Shr<&'a T> for &'b Rgb<T>

where &'b T: Shr<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the >> operator.

fn shr(self, rhs: &'a T) -> <&'b Rgb<T> as Shr<&'a T>>::Output

Performs the >> operation.

impl<'a, T> Shr<Rgb<T>> for &'a Rgb<T>

where &'a T: Shr<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the >> operator.

fn shr(self, rhs: Rgb<T>) -> <&'a Rgb<T> as Shr<Rgb<T>>>::Output

Performs the >> operation.

impl<'a, T> Shr<T> for &'a Rgb<T>

where &'a T: Shr<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the >> operator.

fn shr(self, rhs: T) -> <&'a Rgb<T> as Shr<T>>::Output

Performs the >> operation.

impl<V, T> Shr<V> for Rgb<T>

where V: Into<Rgb<T>>, T: Shr<Output = T>,

type Output = Rgb<T>

The resulting type after applying the >> operator.

fn shr(self, rhs: V) -> <Rgb<T> as Shr<V>>::Output

Performs the >> operation.

impl<V, T> ShrAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: ShrAssign,

fn shr_assign(&mut self, rhs: V)

Performs the >>= operation.

impl<'a, 'b, T> Sub<&'a Rgb<T>> for &'b Rgb<T>

where &'b T: Sub<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a Rgb<T>) -> <&'b Rgb<T> as Sub<&'a Rgb<T>>>::Output

Performs the - operation.

impl<'a, T> Sub<&'a Rgb<T>> for Rgb<T>

where T: Sub<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a Rgb<T>) -> <Rgb<T> as Sub<&'a Rgb<T>>>::Output

Performs the - operation.

impl<'a, 'b, T> Sub<&'a T> for &'b Rgb<T>

where &'b T: Sub<&'a T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the - operator.

fn sub(self, rhs: &'a T) -> <&'b Rgb<T> as Sub<&'a T>>::Output

Performs the - operation.

impl<'a, T> Sub<Rgb<T>> for &'a Rgb<T>

where &'a T: Sub<T, Output = T>,

type Output = Rgb<T>

The resulting type after applying the - operator.

fn sub(self, rhs: Rgb<T>) -> <&'a Rgb<T> as Sub<Rgb<T>>>::Output

Performs the - operation.

impl<'a, T> Sub<T> for &'a Rgb<T>

where &'a T: Sub<T, Output = T>, T: Copy,

type Output = Rgb<T>

The resulting type after applying the - operator.

fn sub(self, rhs: T) -> <&'a Rgb<T> as Sub<T>>::Output

Performs the - operation.

impl<V, T> Sub<V> for Rgb<T>

where V: Into<Rgb<T>>, T: Sub<Output = T>,

type Output = Rgb<T>

The resulting type after applying the - operator.

fn sub(self, rhs: V) -> <Rgb<T> as Sub<V>>::Output

Performs the - operation.

impl<V, T> SubAssign<V> for Rgb<T>

where V: Into<Rgb<T>>, T: SubAssign,

fn sub_assign(&mut self, rhs: V)

Performs the -= operation.

impl<T> Sum for Rgb<T>

where T: Add<Output = T> + Zero,

fn sum<I>(iter: I) -> Rgb<T>

where I: Iterator<Item = Rgb<T>>,

Method which takes an iterator and generates Self from the elements by “summing up” the items.

impl<T> UlpsEq for Rgb<T>

where T: UlpsEq, <T as AbsDiffEq>::Epsilon: Copy,

fn default_max_ulps() -> u32

The default ULPs to tolerate when testing values that are far-apart.

fn ulps_eq( &self, other: &Rgb<T>, epsilon: <T as AbsDiffEq>::Epsilon, max_ulps: u32, ) -> bool

A test for equality that uses units in the last place (ULP) if the values are far apart.

fn ulps_ne(&self, other: &Rhs, epsilon: Self::Epsilon, max_ulps: u32) -> bool

The inverse of [UlpsEq::ulps_eq].

impl<T> Wrap<T> for Rgb<T>

where T: Wrap + Copy,

fn wrapped(self, upper: T) -> Rgb<T>

Returns this value, wrapped between zero and some upper bound (both inclusive).

fn wrapped_between(self, lower: T, upper: T) -> Rgb<T>

Returns this value, wrapped between lower (inclusive) and upper (exclusive).

fn pingpong(self, upper: T) -> Rgb<T>

Wraps a value such that it goes back and forth from zero to upper (inclusive) as it increases.

fn wrap(val: Self, upper: Bound) -> Self

Alias to wrapped() which doesn’t take self.

impl<T> Wrap for Rgb<T>

where T: Wrap,

fn wrapped(self, upper: Rgb<T>) -> Rgb<T>

Returns this value, wrapped between zero and some upper bound (both inclusive).

fn wrapped_between(self, lower: Rgb<T>, upper: Rgb<T>) -> Rgb<T>

Returns this value, wrapped between lower (inclusive) and upper (exclusive).

fn pingpong(self, upper: Rgb<T>) -> Rgb<T>

Wraps a value such that it goes back and forth from zero to upper (inclusive) as it increases.

fn wrap(val: Self, upper: Bound) -> Self

Alias to wrapped() which doesn’t take self.

impl<T> WrappingAdd for Rgb<T>

where T: WrappingAdd,

fn wrapping_add(&self, v: &Rgb<T>) -> Rgb<T>

Wrapping (modular) addition. Computes self + other, wrapping around at the boundary of the type.

impl<T> WrappingMul for Rgb<T>

where T: WrappingMul,

fn wrapping_mul(&self, v: &Rgb<T>) -> Rgb<T>

Wrapping (modular) multiplication. Computes self * other, wrapping around at the boundary of the type.

impl<T> WrappingNeg for Rgb<T>

where T: WrappingNeg,

fn wrapping_neg(&self) -> Rgb<T>

Wrapping (modular) negation. Computes -self, wrapping around at the boundary of the type.

impl<T> WrappingSub for Rgb<T>

where T: WrappingSub,

fn wrapping_sub(&self, v: &Rgb<T>) -> Rgb<T>

Wrapping (modular) subtraction. Computes self - other, wrapping around at the boundary of the type.

impl<T> Zero for Rgb<T>

where T: Zero + PartialEq,

fn zero() -> Rgb<T>

Returns the additive identity element of Self, 0.

fn is_zero(&self) -> bool

Returns true if self is equal to the additive identity.

fn set_zero(&mut self)

Sets self to the additive identity element of Self, 0.

impl<T> Deref for Rgb<T>

type Target = [T]

The resulting type after dereferencing.

fn deref(&self) -> &[T]

Dereferences the value.

impl<T> Copy for Rgb<T>

where T: Copy,

impl<T> Eq for Rgb<T>

where T: Eq,

impl<T> StructuralPartialEq for Rgb<T>