#[repr(simd)]pub struct Simd<T, const LANES: usize>(_)
where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount;
portable_simd
)Expand description
A SIMD vector of LANES
elements of type T
. Simd<T, N>
has the same shape as [T; N]
, but operates like T
.
Two vectors of the same type and length will, by convention, support the operators (+, *, etc.) that T
does.
These take the lanes at each index on the left-hand side and right-hand side, perform the operation,
and return the result in the same lane in a vector of equal size. For a given operator, this is equivalent to zipping
the two arrays together and mapping the operator over each lane.
let a0: [i32; 4] = [-2, 0, 2, 4];
let a1 = [10, 9, 8, 7];
let zm_add = a0.zip(a1).map(|(lhs, rhs)| lhs + rhs);
let zm_mul = a0.zip(a1).map(|(lhs, rhs)| lhs * rhs);
// `Simd<T, N>` implements `From<[T; N]>
let (v0, v1) = (Simd::from(a0), Simd::from(a1));
// Which means arrays implement `Into<Simd<T, N>>`.
assert_eq!(v0 + v1, zm_add.into());
assert_eq!(v0 * v1, zm_mul.into());
Simd
with integers has the quirk that these operations are also inherently wrapping, as if T
was Wrapping<T>
.
Thus, Simd
does not implement wrapping_add
, because that is the default behavior.
This means there is no warning on overflows, even in “debug” builds.
For most applications where Simd
is appropriate, it is “not a bug” to wrap,
and even “debug builds” are unlikely to tolerate the loss of performance.
You may want to consider using explicitly checked arithmetic if such is required.
Division by zero still causes a panic, so you may want to consider using floating point numbers if that is unacceptable.
Layout
Simd<T, N>
has a layout similar to [T; N]
(identical “shapes”), but with a greater alignment.
[T; N]
is aligned to T
, but Simd<T, N>
will have an alignment based on both T
and N
.
It is thus sound to transmute
Simd<T, N>
to [T; N]
, and will typically optimize to zero cost,
but the reverse transmutation is more likely to require a copy the compiler cannot simply elide.
ABI “Features”
Due to Rust’s safety guarantees, Simd<T, N>
is currently passed to and from functions via memory, not SIMD registers,
except as an optimization. #[inline]
hints are recommended on functions that accept Simd<T, N>
or return it.
The need for this may be corrected in the future.
Safe SIMD with Unsafe Rust
Operations with Simd
are typically safe, but there are many reasons to want to combine SIMD with unsafe
code.
Care must be taken to respect differences between Simd
and other types it may be transformed into or derived from.
In particular, the layout of Simd<T, N>
may be similar to [T; N]
, and may allow some transmutations,
but references to [T; N]
are not interchangeable with those to Simd<T, N>
.
Thus, when using unsafe
Rust to read and write Simd<T, N>
through raw pointers, it is a good idea to first try with
read_unaligned
and write_unaligned
. This is because:
read
andwrite
require full alignment (in this case,Simd<T, N>
’s alignment)- the likely source for reading or destination for writing
Simd<T, N>
is[T]
and similar types, aligned toT
- combining these actions would violate the
unsafe
contract and explode the program into a puff of undefined behavior - the compiler can implicitly adjust layouts to make unaligned reads or writes fully aligned if it sees the optimization
- most contemporary processors suffer no performance penalty for “unaligned” reads and writes that are aligned at runtime
By imposing less obligations, unaligned functions are less likely to make the program unsound,
and may be just as fast as stricter alternatives.
When trying to guarantee alignment, [T]::as_simd
is an option for converting [T]
to [Simd<T, N>]
,
and allows soundly operating on an aligned SIMD body, but it may cost more time when handling the scalar head and tail.
If these are not sufficient, then it is most ideal to design data structures to be already aligned
to the Simd<T, N>
you wish to use before using unsafe
Rust to read or write.
More conventional ways to compensate for these facts, like materializing Simd
to or from an array first,
are handled by safe methods like Simd::from_array
and Simd::from_slice
.
Implementations
sourceimpl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + BitAnd<T, Output = T>,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + BitAnd<T, Output = T>,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourcepub fn reduce_and(self) -> T
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_and(self) -> T
portable_simd
)Reducing bitwise “and”. Returns the cumulative bitwise “and” across the lanes of the vector.
sourceimpl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + BitOr<T, Output = T>,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + BitOr<T, Output = T>,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + BitXor<T, Output = T>,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + BitXor<T, Output = T>,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourcepub fn reduce_xor(self) -> T
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_xor(self) -> T
portable_simd
)Reducing bitwise “xor”. Returns the cumulative bitwise “xor” across the lanes of the vector.
sourceimpl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reverse(self) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reverse(self) -> Simd<T, LANES>
portable_simd
)Reverse the order of the lanes in the vector.
sourcepub fn rotate_lanes_left<const OFFSET: usize>(self) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn rotate_lanes_left<const OFFSET: usize>(self) -> Simd<T, LANES>
portable_simd
)Rotates the vector such that the first OFFSET
elements of the slice move to the end
while the last LANES - OFFSET
elements move to the front. After calling rotate_lanes_left
,
the element previously in lane OFFSET
will become the first element in the slice.
sourcepub fn rotate_lanes_right<const OFFSET: usize>(self) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn rotate_lanes_right<const OFFSET: usize>(self) -> Simd<T, LANES>
portable_simd
)Rotates the vector such that the first LANES - OFFSET
elements of the vector move to
the end while the last OFFSET
elements move to the front. After calling rotate_lanes_right
,
the element previously at index LANES - OFFSET
will become the first element in the slice.
sourcepub fn interleave(
self,
other: Simd<T, LANES>
) -> (Simd<T, LANES>, Simd<T, LANES>)
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn interleave(
self,
other: Simd<T, LANES>
) -> (Simd<T, LANES>, Simd<T, LANES>)
portable_simd
)Interleave two vectors.
Produces two vectors with lanes taken alternately from self
and other
.
The first result contains the first LANES / 2
lanes from self
and other
,
alternating, starting with the first lane of self
.
The second result contains the last LANES / 2
lanes from self
and other
,
alternating, starting with the lane LANES / 2
from the start of self
.
#![feature(portable_simd)]
let a = Simd::from_array([0, 1, 2, 3]);
let b = Simd::from_array([4, 5, 6, 7]);
let (x, y) = a.interleave(b);
assert_eq!(x.to_array(), [0, 4, 1, 5]);
assert_eq!(y.to_array(), [2, 6, 3, 7]);
sourcepub fn deinterleave(
self,
other: Simd<T, LANES>
) -> (Simd<T, LANES>, Simd<T, LANES>)
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn deinterleave(
self,
other: Simd<T, LANES>
) -> (Simd<T, LANES>, Simd<T, LANES>)
portable_simd
)Deinterleave two vectors.
The first result takes every other lane of self
and then other
, starting with
the first lane.
The second result takes every other lane of self
and then other
, starting with
the second lane.
#![feature(portable_simd)]
let a = Simd::from_array([0, 4, 1, 5]);
let b = Simd::from_array([2, 6, 3, 7]);
let (x, y) = a.deinterleave(b);
assert_eq!(x.to_array(), [0, 1, 2, 3]);
assert_eq!(y.to_array(), [4, 5, 6, 7]);
sourceimpl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + PartialEq<T>,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + PartialEq<T>,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + PartialOrd<T>,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement + PartialOrd<T>,
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn lanes_lt(
self,
other: Simd<T, LANES>
) -> Mask<<T as SimdElement>::Mask, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn lanes_lt(
self,
other: Simd<T, LANES>
) -> Mask<<T as SimdElement>::Mask, LANES>
portable_simd
)Test if each lane is less than the corresponding lane in other
.
sourcepub fn lanes_gt(
self,
other: Simd<T, LANES>
) -> Mask<<T as SimdElement>::Mask, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn lanes_gt(
self,
other: Simd<T, LANES>
) -> Mask<<T as SimdElement>::Mask, LANES>
portable_simd
)Test if each lane is greater than the corresponding lane in other
.
sourceimpl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourcepub const LANES: usize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub const LANES: usize
portable_simd
)Number of lanes in this vector.
sourcepub const fn lanes(&self) -> usize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub const fn lanes(&self) -> usize
portable_simd
)Get the number of lanes in this vector.
sourcepub const fn splat(value: T) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub const fn splat(value: T) -> Simd<T, LANES>
portable_simd
)Construct a SIMD vector by setting all lanes to the given value.
sourcepub const fn as_array(&self) -> &[T; LANES]
🔬 This is a nightly-only experimental API. (portable_simd
)
pub const fn as_array(&self) -> &[T; LANES]
portable_simd
)Returns an array reference containing the entire SIMD vector.
sourcepub fn as_mut_array(&mut self) -> &mut [T; LANES]
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn as_mut_array(&mut self) -> &mut [T; LANES]
portable_simd
)Returns a mutable array reference containing the entire SIMD vector.
sourcepub const fn from_array(array: [T; LANES]) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub const fn from_array(array: [T; LANES]) -> Simd<T, LANES>
portable_simd
)Converts an array to a SIMD vector.
sourcepub const fn to_array(self) -> [T; LANES]
🔬 This is a nightly-only experimental API. (portable_simd
)
pub const fn to_array(self) -> [T; LANES]
portable_simd
)Converts a SIMD vector to an array.
sourcepub const fn from_slice(slice: &[T]) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub const fn from_slice(slice: &[T]) -> Simd<T, LANES>
portable_simd
)Converts a slice to a SIMD vector containing slice[..LANES]
Panics
from_slice
will panic if the slice’s len
is less than the vector’s Simd::LANES
.
sourcepub fn cast<U>(self) -> Simd<U, LANES> where
U: SimdElement,
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn cast<U>(self) -> Simd<U, LANES> where
U: SimdElement,
portable_simd
)Performs lanewise conversion of a SIMD vector’s elements to another SIMD-valid type.
This follows the semantics of Rust’s as
conversion for casting
integers to unsigned integers (interpreting as the other type, so -1
to MAX
),
and from floats to integers (truncating, or saturating at the limits) for each lane,
or vice versa.
Examples
let floats: Simd<f32, 4> = Simd::from_array([1.9, -4.5, f32::INFINITY, f32::NAN]);
let ints = floats.cast::<i32>();
assert_eq!(ints, Simd::from_array([1, -4, i32::MAX, 0]));
// Formally equivalent, but `Simd::cast` can optimize better.
assert_eq!(ints, Simd::from_array(floats.to_array().map(|x| x as i32)));
// The float conversion does not round-trip.
let floats_again = ints.cast();
assert_ne!(floats, floats_again);
assert_eq!(floats_again, Simd::from_array([1.0, -4.0, 2147483647.0, 0.0]));
sourcepub fn gather_or(
slice: &[T],
idxs: Simd<usize, LANES>,
or: Simd<T, LANES>
) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn gather_or(
slice: &[T],
idxs: Simd<usize, LANES>,
or: Simd<T, LANES>
) -> Simd<T, LANES>
portable_simd
)Reads from potentially discontiguous indices in slice
to construct a SIMD vector.
If an index is out-of-bounds, the lane is instead selected from the or
vector.
Examples
let vec: Vec<i32> = vec![10, 11, 12, 13, 14, 15, 16, 17, 18];
let idxs = Simd::from_array([9, 3, 0, 5]);
let alt = Simd::from_array([-5, -4, -3, -2]);
let result = Simd::gather_or(&vec, idxs, alt); // Note the lane that is out-of-bounds.
assert_eq!(result, Simd::from_array([-5, 13, 10, 15]));
sourcepub fn gather_or_default(
slice: &[T],
idxs: Simd<usize, LANES>
) -> Simd<T, LANES> where
T: Default,
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn gather_or_default(
slice: &[T],
idxs: Simd<usize, LANES>
) -> Simd<T, LANES> where
T: Default,
portable_simd
)Reads from potentially discontiguous indices in slice
to construct a SIMD vector.
If an index is out-of-bounds, the lane is set to the default value for the type.
Examples
let vec: Vec<i32> = vec![10, 11, 12, 13, 14, 15, 16, 17, 18];
let idxs = Simd::from_array([9, 3, 0, 5]);
let result = Simd::gather_or_default(&vec, idxs); // Note the lane that is out-of-bounds.
assert_eq!(result, Simd::from_array([0, 13, 10, 15]));
sourcepub fn gather_select(
slice: &[T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>,
or: Simd<T, LANES>
) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn gather_select(
slice: &[T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>,
or: Simd<T, LANES>
) -> Simd<T, LANES>
portable_simd
)Reads from potentially discontiguous indices in slice
to construct a SIMD vector.
The mask enable
s all true
lanes and disables all false
lanes.
If an index is disabled or is out-of-bounds, the lane is selected from the or
vector.
Examples
let vec: Vec<i32> = vec![10, 11, 12, 13, 14, 15, 16, 17, 18];
let idxs = Simd::from_array([9, 3, 0, 5]);
let alt = Simd::from_array([-5, -4, -3, -2]);
let enable = Mask::from_array([true, true, true, false]); // Note the mask of the last lane.
let result = Simd::gather_select(&vec, enable, idxs, alt); // Note the lane that is out-of-bounds.
assert_eq!(result, Simd::from_array([-5, 13, 10, -2]));
sourcepub unsafe fn gather_select_unchecked(
slice: &[T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>,
or: Simd<T, LANES>
) -> Simd<T, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub unsafe fn gather_select_unchecked(
slice: &[T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>,
or: Simd<T, LANES>
) -> Simd<T, LANES>
portable_simd
)Reads from potentially discontiguous indices in slice
to construct a SIMD vector.
The mask enable
s all true
lanes and disables all false
lanes.
If an index is disabled, the lane is selected from the or
vector.
Safety
Calling this function with an enable
d out-of-bounds index is undefined behavior
even if the resulting value is not used.
Examples
let vec: Vec<i32> = vec![10, 11, 12, 13, 14, 15, 16, 17, 18];
let idxs = Simd::from_array([9, 3, 0, 5]);
let alt = Simd::from_array([-5, -4, -3, -2]);
let enable = Mask::from_array([true, true, true, false]); // Note the final mask lane.
// If this mask was used to gather, it would be unsound. Let's fix that.
let enable = enable & idxs.lanes_lt(Simd::splat(vec.len()));
// We have masked the OOB lane, so it's safe to gather now.
let result = unsafe { Simd::gather_select_unchecked(&vec, enable, idxs, alt) };
assert_eq!(result, Simd::from_array([-5, 13, 10, -2]));
sourcepub fn scatter(self, slice: &mut [T], idxs: Simd<usize, LANES>)
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn scatter(self, slice: &mut [T], idxs: Simd<usize, LANES>)
portable_simd
)Writes the values in a SIMD vector to potentially discontiguous indices in slice
.
If two lanes in the scattered vector would write to the same index
only the last lane is guaranteed to actually be written.
Examples
let mut vec: Vec<i32> = vec![10, 11, 12, 13, 14, 15, 16, 17, 18];
let idxs = Simd::from_array([9, 3, 0, 0]);
let vals = Simd::from_array([-27, 82, -41, 124]);
vals.scatter(&mut vec, idxs); // index 0 receives two writes.
assert_eq!(vec, vec![124, 11, 12, 82, 14, 15, 16, 17, 18]);
sourcepub fn scatter_select(
self,
slice: &mut [T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>
)
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn scatter_select(
self,
slice: &mut [T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>
)
portable_simd
)Writes the values in a SIMD vector to multiple potentially discontiguous indices in slice
.
The mask enable
s all true
lanes and disables all false
lanes.
If an enabled index is out-of-bounds, the lane is not written.
If two enabled lanes in the scattered vector would write to the same index,
only the last lane is guaranteed to actually be written.
Examples
let mut vec: Vec<i32> = vec![10, 11, 12, 13, 14, 15, 16, 17, 18];
let idxs = Simd::from_array([9, 3, 0, 0]);
let vals = Simd::from_array([-27, 82, -41, 124]);
let enable = Mask::from_array([true, true, true, false]); // Note the mask of the last lane.
vals.scatter_select(&mut vec, enable, idxs); // index 0's second write is masked, thus omitted.
assert_eq!(vec, vec![-41, 11, 12, 82, 14, 15, 16, 17, 18]);
sourcepub unsafe fn scatter_select_unchecked(
self,
slice: &mut [T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>
)
🔬 This is a nightly-only experimental API. (portable_simd
)
pub unsafe fn scatter_select_unchecked(
self,
slice: &mut [T],
enable: Mask<isize, LANES>,
idxs: Simd<usize, LANES>
)
portable_simd
)Writes the values in a SIMD vector to multiple potentially discontiguous indices in slice
.
The mask enable
s all true
lanes and disables all false
lanes.
If two enabled lanes in the scattered vector would write to the same index,
only the last lane is guaranteed to actually be written.
Safety
Calling this function with an enabled out-of-bounds index is undefined behavior, and may lead to memory corruption.
Examples
let mut vec: Vec<i32> = vec![10, 11, 12, 13, 14, 15, 16, 17, 18];
let idxs = Simd::from_array([9, 3, 0, 0]);
let vals = Simd::from_array([-27, 82, -41, 124]);
let enable = Mask::from_array([true, true, true, false]); // Note the mask of the last lane.
// If this mask was used to scatter, it would be unsound. Let's fix that.
let enable = enable & idxs.lanes_lt(Simd::splat(vec.len()));
// We have masked the OOB lane, so it's safe to scatter now.
unsafe { vals.scatter_select_unchecked(&mut vec, enable, idxs); }
// index 0's second write is masked, thus was omitted.
assert_eq!(vec, vec![-41, 11, 12, 82, 14, 15, 16, 17, 18]);
sourceimpl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> i8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> i8
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> i8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> i8
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> i8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> i8
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> i8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> i8
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> i16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> i16
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> i16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> i16
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> i16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> i16
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> i16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> i16
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> i32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> i32
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> i32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> i32
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> i32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> i32
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> i32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> i32
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> i64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> i64
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> i64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> i64
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> i64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> i64
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> i64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> i64
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> isize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> isize
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> isize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> isize
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> isize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> isize
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> isize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> isize
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> u8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> u8
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> u8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> u8
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> u8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> u8
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> u8
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> u8
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> u16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> u16
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> u16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> u16
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> u16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> u16
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> u16
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> u16
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> u32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> u32
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> u32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> u32
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> u32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> u32
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> u32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> u32
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> u64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> u64
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> u64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> u64
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> u64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> u64
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> u64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> u64
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> usize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> usize
portable_simd
)Reducing wrapping add. Returns the sum of the lanes of the vector, with wrapping addition.
sourcepub fn reduce_product(self) -> usize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> usize
portable_simd
)Reducing wrapping multiply. Returns the product of the lanes of the vector, with wrapping multiplication.
sourcepub fn reduce_max(self) -> usize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> usize
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
sourcepub fn reduce_min(self) -> usize
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> usize
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
sourceimpl<const LANES: usize> Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> f32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> f32
portable_simd
)Reducing add. Returns the sum of the lanes of the vector.
sourcepub fn reduce_product(self) -> f32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> f32
portable_simd
)Reducing multiply. Returns the product of the lanes of the vector.
sourcepub fn reduce_max(self) -> f32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> f32
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
Returns values based on equality, so a vector containing both 0.
and -0.
may
return either. This function will not return NaN
unless all lanes are NaN
.
sourcepub fn reduce_min(self) -> f32
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> f32
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
Returns values based on equality, so a vector containing both 0.
and -0.
may
return either. This function will not return NaN
unless all lanes are NaN
.
sourceimpl<const LANES: usize> Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn reduce_sum(self) -> f64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_sum(self) -> f64
portable_simd
)Reducing add. Returns the sum of the lanes of the vector.
sourcepub fn reduce_product(self) -> f64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_product(self) -> f64
portable_simd
)Reducing multiply. Returns the product of the lanes of the vector.
sourcepub fn reduce_max(self) -> f64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_max(self) -> f64
portable_simd
)Reducing maximum. Returns the maximum lane in the vector.
Returns values based on equality, so a vector containing both 0.
and -0.
may
return either. This function will not return NaN
unless all lanes are NaN
.
sourcepub fn reduce_min(self) -> f64
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn reduce_min(self) -> f64
portable_simd
)Reducing minimum. Returns the minimum lane in the vector.
Returns values based on equality, so a vector containing both 0.
and -0.
may
return either. This function will not return NaN
unless all lanes are NaN
.
sourceimpl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<i8, LANES>) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<i8, LANES>) -> Simd<i8, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<i8, LANES>) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<i8, LANES>) -> Simd<i8, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<i8, LANES>,
max: Simd<i8, LANES>
) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<i8, LANES>,
max: Simd<i8, LANES>
) -> Simd<i8, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<i16, LANES>) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<i16, LANES>) -> Simd<i16, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<i16, LANES>) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<i16, LANES>) -> Simd<i16, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<i16, LANES>,
max: Simd<i16, LANES>
) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<i16, LANES>,
max: Simd<i16, LANES>
) -> Simd<i16, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<i32, LANES>) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<i32, LANES>) -> Simd<i32, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<i32, LANES>) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<i32, LANES>) -> Simd<i32, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<i32, LANES>,
max: Simd<i32, LANES>
) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<i32, LANES>,
max: Simd<i32, LANES>
) -> Simd<i32, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<i64, LANES>) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<i64, LANES>) -> Simd<i64, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<i64, LANES>) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<i64, LANES>) -> Simd<i64, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<i64, LANES>,
max: Simd<i64, LANES>
) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<i64, LANES>,
max: Simd<i64, LANES>
) -> Simd<i64, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<isize, LANES>) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<isize, LANES>) -> Simd<isize, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<isize, LANES>) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<isize, LANES>) -> Simd<isize, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<isize, LANES>,
max: Simd<isize, LANES>
) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<isize, LANES>,
max: Simd<isize, LANES>
) -> Simd<isize, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<u8, LANES>) -> Simd<u8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<u8, LANES>) -> Simd<u8, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<u8, LANES>) -> Simd<u8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<u8, LANES>) -> Simd<u8, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<u8, LANES>,
max: Simd<u8, LANES>
) -> Simd<u8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<u8, LANES>,
max: Simd<u8, LANES>
) -> Simd<u8, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<u16, LANES>) -> Simd<u16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<u16, LANES>) -> Simd<u16, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<u16, LANES>) -> Simd<u16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<u16, LANES>) -> Simd<u16, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<u16, LANES>,
max: Simd<u16, LANES>
) -> Simd<u16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<u16, LANES>,
max: Simd<u16, LANES>
) -> Simd<u16, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<u32, LANES>) -> Simd<u32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<u32, LANES>) -> Simd<u32, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<u32, LANES>) -> Simd<u32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<u32, LANES>) -> Simd<u32, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<u32, LANES>,
max: Simd<u32, LANES>
) -> Simd<u32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<u32, LANES>,
max: Simd<u32, LANES>
) -> Simd<u32, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<u64, LANES>) -> Simd<u64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<u64, LANES>) -> Simd<u64, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<u64, LANES>) -> Simd<u64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<u64, LANES>) -> Simd<u64, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<u64, LANES>,
max: Simd<u64, LANES>
) -> Simd<u64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<u64, LANES>,
max: Simd<u64, LANES>
) -> Simd<u64, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn min(self, other: Simd<usize, LANES>) -> Simd<usize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<usize, LANES>) -> Simd<usize, LANES>
portable_simd
)Returns the lane-wise minimum with other
.
sourcepub fn max(self, other: Simd<usize, LANES>) -> Simd<usize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<usize, LANES>) -> Simd<usize, LANES>
portable_simd
)Returns the lane-wise maximum with other
.
sourcepub fn clamp(
self,
min: Simd<usize, LANES>,
max: Simd<usize, LANES>
) -> Simd<usize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<usize, LANES>,
max: Simd<usize, LANES>
) -> Simd<usize, LANES>
portable_simd
)Restrict each lane to a certain interval.
For each lane, returns max
if self
is greater than max
, and min
if self
is
less than min
. Otherwise returns self
.
Panics
Panics if min > max
on any lane.
sourceimpl<const LANES: usize> Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<u8, LANES>) -> Simd<u8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<u8, LANES>) -> Simd<u8, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([1, 0, MAX, MAX - 1]));
assert_eq!(sat, max);
sourcepub fn saturating_sub(self, second: Simd<u8, LANES>) -> Simd<u8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<u8, LANES>) -> Simd<u8, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([3, 2, 1, 0]));
assert_eq!(sat, Simd::splat(0));
sourceimpl<const LANES: usize> Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<u16, LANES>) -> Simd<u16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<u16, LANES>) -> Simd<u16, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([1, 0, MAX, MAX - 1]));
assert_eq!(sat, max);
sourcepub fn saturating_sub(self, second: Simd<u16, LANES>) -> Simd<u16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<u16, LANES>) -> Simd<u16, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([3, 2, 1, 0]));
assert_eq!(sat, Simd::splat(0));
sourceimpl<const LANES: usize> Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<u32, LANES>) -> Simd<u32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<u32, LANES>) -> Simd<u32, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([1, 0, MAX, MAX - 1]));
assert_eq!(sat, max);
sourcepub fn saturating_sub(self, second: Simd<u32, LANES>) -> Simd<u32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<u32, LANES>) -> Simd<u32, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([3, 2, 1, 0]));
assert_eq!(sat, Simd::splat(0));
sourceimpl<const LANES: usize> Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<u64, LANES>) -> Simd<u64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<u64, LANES>) -> Simd<u64, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([1, 0, MAX, MAX - 1]));
assert_eq!(sat, max);
sourcepub fn saturating_sub(self, second: Simd<u64, LANES>) -> Simd<u64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<u64, LANES>) -> Simd<u64, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([3, 2, 1, 0]));
assert_eq!(sat, Simd::splat(0));
sourceimpl<const LANES: usize> Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<usize, LANES>) -> Simd<usize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<usize, LANES>) -> Simd<usize, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([1, 0, MAX, MAX - 1]));
assert_eq!(sat, max);
sourcepub fn saturating_sub(self, second: Simd<usize, LANES>) -> Simd<usize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<usize, LANES>) -> Simd<usize, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([2, 1, 0, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([3, 2, 1, 0]));
assert_eq!(sat, Simd::splat(0));
sourceimpl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<i8, LANES>) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<i8, LANES>) -> Simd<i8, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([MIN, 0, 1, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([-1, MAX, MIN, -2]));
assert_eq!(sat, Simd::from_array([-1, MAX, MAX, MAX]));
sourcepub fn saturating_sub(self, second: Simd<i8, LANES>) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<i8, LANES>) -> Simd<i8, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([MIN, -2, -1, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([1, MAX, MIN, 0]));
assert_eq!(sat, Simd::from_array([MIN, MIN, MIN, 0]));
sourcepub fn abs(self) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn abs(self) -> Simd<i8, LANES>
portable_simd
)Lanewise absolute value, implemented in Rust. Every lane becomes its absolute value.
Examples
let xs = Simd::from_array([MIN, MIN +1, -5, 0]);
assert_eq!(xs.abs(), Simd::from_array([MIN, MAX, 5, 0]));
sourcepub fn saturating_abs(self) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_abs(self) -> Simd<i8, LANES>
portable_simd
)Lanewise saturating absolute value, implemented in Rust. As abs(), except the MIN value becomes MAX instead of itself.
Examples
let xs = Simd::from_array([MIN, -2, 0, 3]);
let unsat = xs.abs();
let sat = xs.saturating_abs();
assert_eq!(unsat, Simd::from_array([MIN, 2, 0, 3]));
assert_eq!(sat, Simd::from_array([MAX, 2, 0, 3]));
sourcepub fn saturating_neg(self) -> Simd<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_neg(self) -> Simd<i8, LANES>
portable_simd
)Lanewise saturating negation, implemented in Rust. As neg(), except the MIN value becomes MAX instead of itself.
Examples
let x = Simd::from_array([MIN, -2, 3, MAX]);
let unsat = -x;
let sat = x.saturating_neg();
assert_eq!(unsat, Simd::from_array([MIN, 2, -3, MIN + 1]));
assert_eq!(sat, Simd::from_array([MAX, 2, -3, MIN + 1]));
sourceimpl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<i16, LANES>) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<i16, LANES>) -> Simd<i16, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([MIN, 0, 1, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([-1, MAX, MIN, -2]));
assert_eq!(sat, Simd::from_array([-1, MAX, MAX, MAX]));
sourcepub fn saturating_sub(self, second: Simd<i16, LANES>) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<i16, LANES>) -> Simd<i16, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([MIN, -2, -1, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([1, MAX, MIN, 0]));
assert_eq!(sat, Simd::from_array([MIN, MIN, MIN, 0]));
sourcepub fn abs(self) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn abs(self) -> Simd<i16, LANES>
portable_simd
)Lanewise absolute value, implemented in Rust. Every lane becomes its absolute value.
Examples
let xs = Simd::from_array([MIN, MIN +1, -5, 0]);
assert_eq!(xs.abs(), Simd::from_array([MIN, MAX, 5, 0]));
sourcepub fn saturating_abs(self) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_abs(self) -> Simd<i16, LANES>
portable_simd
)Lanewise saturating absolute value, implemented in Rust. As abs(), except the MIN value becomes MAX instead of itself.
Examples
let xs = Simd::from_array([MIN, -2, 0, 3]);
let unsat = xs.abs();
let sat = xs.saturating_abs();
assert_eq!(unsat, Simd::from_array([MIN, 2, 0, 3]));
assert_eq!(sat, Simd::from_array([MAX, 2, 0, 3]));
sourcepub fn saturating_neg(self) -> Simd<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_neg(self) -> Simd<i16, LANES>
portable_simd
)Lanewise saturating negation, implemented in Rust. As neg(), except the MIN value becomes MAX instead of itself.
Examples
let x = Simd::from_array([MIN, -2, 3, MAX]);
let unsat = -x;
let sat = x.saturating_neg();
assert_eq!(unsat, Simd::from_array([MIN, 2, -3, MIN + 1]));
assert_eq!(sat, Simd::from_array([MAX, 2, -3, MIN + 1]));
sourceimpl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<i32, LANES>) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<i32, LANES>) -> Simd<i32, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([MIN, 0, 1, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([-1, MAX, MIN, -2]));
assert_eq!(sat, Simd::from_array([-1, MAX, MAX, MAX]));
sourcepub fn saturating_sub(self, second: Simd<i32, LANES>) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<i32, LANES>) -> Simd<i32, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([MIN, -2, -1, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([1, MAX, MIN, 0]));
assert_eq!(sat, Simd::from_array([MIN, MIN, MIN, 0]));
sourcepub fn abs(self) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn abs(self) -> Simd<i32, LANES>
portable_simd
)Lanewise absolute value, implemented in Rust. Every lane becomes its absolute value.
Examples
let xs = Simd::from_array([MIN, MIN +1, -5, 0]);
assert_eq!(xs.abs(), Simd::from_array([MIN, MAX, 5, 0]));
sourcepub fn saturating_abs(self) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_abs(self) -> Simd<i32, LANES>
portable_simd
)Lanewise saturating absolute value, implemented in Rust. As abs(), except the MIN value becomes MAX instead of itself.
Examples
let xs = Simd::from_array([MIN, -2, 0, 3]);
let unsat = xs.abs();
let sat = xs.saturating_abs();
assert_eq!(unsat, Simd::from_array([MIN, 2, 0, 3]));
assert_eq!(sat, Simd::from_array([MAX, 2, 0, 3]));
sourcepub fn saturating_neg(self) -> Simd<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_neg(self) -> Simd<i32, LANES>
portable_simd
)Lanewise saturating negation, implemented in Rust. As neg(), except the MIN value becomes MAX instead of itself.
Examples
let x = Simd::from_array([MIN, -2, 3, MAX]);
let unsat = -x;
let sat = x.saturating_neg();
assert_eq!(unsat, Simd::from_array([MIN, 2, -3, MIN + 1]));
assert_eq!(sat, Simd::from_array([MAX, 2, -3, MIN + 1]));
sourceimpl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<i64, LANES>) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<i64, LANES>) -> Simd<i64, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([MIN, 0, 1, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([-1, MAX, MIN, -2]));
assert_eq!(sat, Simd::from_array([-1, MAX, MAX, MAX]));
sourcepub fn saturating_sub(self, second: Simd<i64, LANES>) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<i64, LANES>) -> Simd<i64, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([MIN, -2, -1, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([1, MAX, MIN, 0]));
assert_eq!(sat, Simd::from_array([MIN, MIN, MIN, 0]));
sourcepub fn abs(self) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn abs(self) -> Simd<i64, LANES>
portable_simd
)Lanewise absolute value, implemented in Rust. Every lane becomes its absolute value.
Examples
let xs = Simd::from_array([MIN, MIN +1, -5, 0]);
assert_eq!(xs.abs(), Simd::from_array([MIN, MAX, 5, 0]));
sourcepub fn saturating_abs(self) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_abs(self) -> Simd<i64, LANES>
portable_simd
)Lanewise saturating absolute value, implemented in Rust. As abs(), except the MIN value becomes MAX instead of itself.
Examples
let xs = Simd::from_array([MIN, -2, 0, 3]);
let unsat = xs.abs();
let sat = xs.saturating_abs();
assert_eq!(unsat, Simd::from_array([MIN, 2, 0, 3]));
assert_eq!(sat, Simd::from_array([MAX, 2, 0, 3]));
sourcepub fn saturating_neg(self) -> Simd<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_neg(self) -> Simd<i64, LANES>
portable_simd
)Lanewise saturating negation, implemented in Rust. As neg(), except the MIN value becomes MAX instead of itself.
Examples
let x = Simd::from_array([MIN, -2, 3, MAX]);
let unsat = -x;
let sat = x.saturating_neg();
assert_eq!(unsat, Simd::from_array([MIN, 2, -3, MIN + 1]));
assert_eq!(sat, Simd::from_array([MAX, 2, -3, MIN + 1]));
sourceimpl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn saturating_add(self, second: Simd<isize, LANES>) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_add(self, second: Simd<isize, LANES>) -> Simd<isize, LANES>
portable_simd
)Lanewise saturating add.
Examples
let x = Simd::from_array([MIN, 0, 1, MAX]);
let max = Simd::splat(MAX);
let unsat = x + max;
let sat = x.saturating_add(max);
assert_eq!(unsat, Simd::from_array([-1, MAX, MIN, -2]));
assert_eq!(sat, Simd::from_array([-1, MAX, MAX, MAX]));
sourcepub fn saturating_sub(self, second: Simd<isize, LANES>) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_sub(self, second: Simd<isize, LANES>) -> Simd<isize, LANES>
portable_simd
)Lanewise saturating subtract.
Examples
let x = Simd::from_array([MIN, -2, -1, MAX]);
let max = Simd::splat(MAX);
let unsat = x - max;
let sat = x.saturating_sub(max);
assert_eq!(unsat, Simd::from_array([1, MAX, MIN, 0]));
assert_eq!(sat, Simd::from_array([MIN, MIN, MIN, 0]));
sourcepub fn abs(self) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn abs(self) -> Simd<isize, LANES>
portable_simd
)Lanewise absolute value, implemented in Rust. Every lane becomes its absolute value.
Examples
let xs = Simd::from_array([MIN, MIN +1, -5, 0]);
assert_eq!(xs.abs(), Simd::from_array([MIN, MAX, 5, 0]));
sourcepub fn saturating_abs(self) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_abs(self) -> Simd<isize, LANES>
portable_simd
)Lanewise saturating absolute value, implemented in Rust. As abs(), except the MIN value becomes MAX instead of itself.
Examples
let xs = Simd::from_array([MIN, -2, 0, 3]);
let unsat = xs.abs();
let sat = xs.saturating_abs();
assert_eq!(unsat, Simd::from_array([MIN, 2, 0, 3]));
assert_eq!(sat, Simd::from_array([MAX, 2, 0, 3]));
sourcepub fn saturating_neg(self) -> Simd<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn saturating_neg(self) -> Simd<isize, LANES>
portable_simd
)Lanewise saturating negation, implemented in Rust. As neg(), except the MIN value becomes MAX instead of itself.
Examples
let x = Simd::from_array([MIN, -2, 3, MAX]);
let unsat = -x;
let sat = x.saturating_neg();
assert_eq!(unsat, Simd::from_array([MIN, 2, -3, MIN + 1]));
assert_eq!(sat, Simd::from_array([MAX, 2, -3, MIN + 1]));
sourceimpl<const LANES: usize> Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub unsafe fn to_int_unchecked<I>(self) -> Simd<I, LANES> where
I: SimdElement,
f32: FloatToInt<I>,
🔬 This is a nightly-only experimental API. (portable_simd
)
pub unsafe fn to_int_unchecked<I>(self) -> Simd<I, LANES> where
I: SimdElement,
f32: FloatToInt<I>,
portable_simd
)Rounds toward zero and converts to the same-width integer type, assuming that the value is finite and fits in that type.
Safety
The value must:
- Not be NaN
- Not be infinite
- Be representable in the return type, after truncating off its fractional part
If these requirements are infeasible or costly, consider using the safe function cast, which saturates on conversion.
sourceimpl<const LANES: usize> Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub unsafe fn to_int_unchecked<I>(self) -> Simd<I, LANES> where
I: SimdElement,
f64: FloatToInt<I>,
🔬 This is a nightly-only experimental API. (portable_simd
)
pub unsafe fn to_int_unchecked<I>(self) -> Simd<I, LANES> where
I: SimdElement,
f64: FloatToInt<I>,
portable_simd
)Rounds toward zero and converts to the same-width integer type, assuming that the value is finite and fits in that type.
Safety
The value must:
- Not be NaN
- Not be infinite
- Be representable in the return type, after truncating off its fractional part
If these requirements are infeasible or costly, consider using the safe function cast, which saturates on conversion.
sourceimpl<const LANES: usize> Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn to_bits(self) -> Simd<u32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn to_bits(self) -> Simd<u32, LANES>
portable_simd
)Raw transmutation to an unsigned integer vector type with the same size and number of lanes.
sourcepub fn from_bits(bits: Simd<u32, LANES>) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn from_bits(bits: Simd<u32, LANES>) -> Simd<f32, LANES>
portable_simd
)Raw transmutation from an unsigned integer vector type with the same size and number of lanes.
sourcepub fn abs(self) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn abs(self) -> Simd<f32, LANES>
portable_simd
)Produces a vector where every lane has the absolute value of the
equivalently-indexed lane in self
.
sourcepub fn recip(self) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn recip(self) -> Simd<f32, LANES>
portable_simd
)Takes the reciprocal (inverse) of each lane, 1/x
.
sourcepub fn to_degrees(self) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn to_degrees(self) -> Simd<f32, LANES>
portable_simd
)Converts each lane from radians to degrees.
sourcepub fn to_radians(self) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn to_radians(self) -> Simd<f32, LANES>
portable_simd
)Converts each lane from degrees to radians.
sourcepub fn is_sign_positive(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_sign_positive(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each lane if it has a positive sign, including
+0.0
, NaN
s with positive sign bit and positive infinity.
sourcepub fn is_sign_negative(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_sign_negative(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each lane if it has a negative sign, including
-0.0
, NaN
s with negative sign bit and negative infinity.
sourcepub fn is_nan(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_nan(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each lane if its value is NaN
.
sourcepub fn is_infinite(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_infinite(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each lane if its value is positive infinity or negative infinity.
sourcepub fn is_finite(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_finite(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each lane if its value is neither infinite nor NaN
.
sourcepub fn is_subnormal(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_subnormal(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each lane if its value is subnormal.
sourcepub fn is_normal(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_normal(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each lane if its value is neither zero, infinite,
subnormal, nor NaN
.
sourcepub fn signum(self) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn signum(self) -> Simd<f32, LANES>
portable_simd
)Replaces each lane with a number that represents its sign.
1.0
if the number is positive,+0.0
, orINFINITY
-1.0
if the number is negative,-0.0
, orNEG_INFINITY
NAN
if the number isNAN
sourcepub fn copysign(self, sign: Simd<f32, LANES>) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn copysign(self, sign: Simd<f32, LANES>) -> Simd<f32, LANES>
portable_simd
)Returns each lane with the magnitude of self
and the sign of sign
.
If any lane is a NAN
, then a NAN
with the sign of sign
is returned.
sourcepub fn min(self, other: Simd<f32, LANES>) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<f32, LANES>) -> Simd<f32, LANES>
portable_simd
)Returns the minimum of each lane.
If one of the values is NAN
, then the other value is returned.
sourcepub fn max(self, other: Simd<f32, LANES>) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<f32, LANES>) -> Simd<f32, LANES>
portable_simd
)Returns the maximum of each lane.
If one of the values is NAN
, then the other value is returned.
sourcepub fn clamp(
self,
min: Simd<f32, LANES>,
max: Simd<f32, LANES>
) -> Simd<f32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<f32, LANES>,
max: Simd<f32, LANES>
) -> Simd<f32, LANES>
portable_simd
)Restrict each lane to a certain interval unless it is NaN.
For each lane in self
, returns the corresponding lane in max
if the lane is
greater than max
, and the corresponding lane in min
if the lane is less
than min
. Otherwise returns the lane in self
.
sourceimpl<const LANES: usize> Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn to_bits(self) -> Simd<u64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn to_bits(self) -> Simd<u64, LANES>
portable_simd
)Raw transmutation to an unsigned integer vector type with the same size and number of lanes.
sourcepub fn from_bits(bits: Simd<u64, LANES>) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn from_bits(bits: Simd<u64, LANES>) -> Simd<f64, LANES>
portable_simd
)Raw transmutation from an unsigned integer vector type with the same size and number of lanes.
sourcepub fn abs(self) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn abs(self) -> Simd<f64, LANES>
portable_simd
)Produces a vector where every lane has the absolute value of the
equivalently-indexed lane in self
.
sourcepub fn recip(self) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn recip(self) -> Simd<f64, LANES>
portable_simd
)Takes the reciprocal (inverse) of each lane, 1/x
.
sourcepub fn to_degrees(self) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn to_degrees(self) -> Simd<f64, LANES>
portable_simd
)Converts each lane from radians to degrees.
sourcepub fn to_radians(self) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn to_radians(self) -> Simd<f64, LANES>
portable_simd
)Converts each lane from degrees to radians.
sourcepub fn is_sign_positive(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_sign_positive(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each lane if it has a positive sign, including
+0.0
, NaN
s with positive sign bit and positive infinity.
sourcepub fn is_sign_negative(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_sign_negative(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each lane if it has a negative sign, including
-0.0
, NaN
s with negative sign bit and negative infinity.
sourcepub fn is_nan(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_nan(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each lane if its value is NaN
.
sourcepub fn is_infinite(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_infinite(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each lane if its value is positive infinity or negative infinity.
sourcepub fn is_finite(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_finite(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each lane if its value is neither infinite nor NaN
.
sourcepub fn is_subnormal(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_subnormal(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each lane if its value is subnormal.
sourcepub fn is_normal(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_normal(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each lane if its value is neither zero, infinite,
subnormal, nor NaN
.
sourcepub fn signum(self) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn signum(self) -> Simd<f64, LANES>
portable_simd
)Replaces each lane with a number that represents its sign.
1.0
if the number is positive,+0.0
, orINFINITY
-1.0
if the number is negative,-0.0
, orNEG_INFINITY
NAN
if the number isNAN
sourcepub fn copysign(self, sign: Simd<f64, LANES>) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn copysign(self, sign: Simd<f64, LANES>) -> Simd<f64, LANES>
portable_simd
)Returns each lane with the magnitude of self
and the sign of sign
.
If any lane is a NAN
, then a NAN
with the sign of sign
is returned.
sourcepub fn min(self, other: Simd<f64, LANES>) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn min(self, other: Simd<f64, LANES>) -> Simd<f64, LANES>
portable_simd
)Returns the minimum of each lane.
If one of the values is NAN
, then the other value is returned.
sourcepub fn max(self, other: Simd<f64, LANES>) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn max(self, other: Simd<f64, LANES>) -> Simd<f64, LANES>
portable_simd
)Returns the maximum of each lane.
If one of the values is NAN
, then the other value is returned.
sourcepub fn clamp(
self,
min: Simd<f64, LANES>,
max: Simd<f64, LANES>
) -> Simd<f64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn clamp(
self,
min: Simd<f64, LANES>,
max: Simd<f64, LANES>
) -> Simd<f64, LANES>
portable_simd
)Restrict each lane to a certain interval unless it is NaN.
For each lane in self
, returns the corresponding lane in max
if the lane is
greater than max
, and the corresponding lane in min
if the lane is less
than min
. Otherwise returns the lane in self
.
sourceimpl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn is_positive(self) -> Mask<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_positive(self) -> Mask<isize, LANES>
portable_simd
)Returns true for each positive lane and false if it is zero or negative.
sourcepub fn is_negative(self) -> Mask<isize, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_negative(self) -> Mask<isize, LANES>
portable_simd
)Returns true for each negative lane and false if it is zero or positive.
sourceimpl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn is_positive(self) -> Mask<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_positive(self) -> Mask<i16, LANES>
portable_simd
)Returns true for each positive lane and false if it is zero or negative.
sourcepub fn is_negative(self) -> Mask<i16, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_negative(self) -> Mask<i16, LANES>
portable_simd
)Returns true for each negative lane and false if it is zero or positive.
sourceimpl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn is_positive(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_positive(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each positive lane and false if it is zero or negative.
sourcepub fn is_negative(self) -> Mask<i32, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_negative(self) -> Mask<i32, LANES>
portable_simd
)Returns true for each negative lane and false if it is zero or positive.
sourceimpl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn is_positive(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_positive(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each positive lane and false if it is zero or negative.
sourcepub fn is_negative(self) -> Mask<i64, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_negative(self) -> Mask<i64, LANES>
portable_simd
)Returns true for each negative lane and false if it is zero or positive.
sourceimpl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourcepub fn is_positive(self) -> Mask<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_positive(self) -> Mask<i8, LANES>
portable_simd
)Returns true for each positive lane and false if it is zero or negative.
sourcepub fn is_negative(self) -> Mask<i8, LANES>
🔬 This is a nightly-only experimental API. (portable_simd
)
pub fn is_negative(self) -> Mask<i8, LANES>
portable_simd
)Returns true for each negative lane and false if it is zero or positive.
Trait Implementations
sourceimpl<'_, T, const LANES: usize> Add<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Add<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> Add<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> Add<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> Add<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Add<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> Add<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Add<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Add<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> AddAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> AddAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Add<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Add<U>>::Output == Simd<T, LANES>,
sourcefn add_assign(&mut self, rhs: U)
fn add_assign(&mut self, rhs: U)
Performs the +=
operation. Read more
sourceimpl<T, const LANES: usize> AsMut<[T; LANES]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> AsMut<[T; LANES]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> AsMut<[T]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> AsMut<[T]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> AsRef<[T; LANES]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> AsRef<[T; LANES]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> AsRef<[T]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> AsRef<[T]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> Binary for Simd<T, LANES> where
T: SimdElement + Binary,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Binary for Simd<T, LANES> where
T: SimdElement + Binary,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'_, T, const LANES: usize> BitAnd<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> BitAnd<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> BitAnd<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> BitAnd<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> BitAnd<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> BitAnd<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> BitAnd<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitAnd<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitAnd<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> BitAndAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> BitAndAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitAnd<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitAnd<U>>::Output == Simd<T, LANES>,
sourcefn bitand_assign(&mut self, rhs: U)
fn bitand_assign(&mut self, rhs: U)
Performs the &=
operation. Read more
sourceimpl<'_, T, const LANES: usize> BitOr<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> BitOr<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> BitOr<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> BitOr<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> BitOr<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> BitOr<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> BitOr<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitOr<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitOr<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> BitOrAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> BitOrAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitOr<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitOr<U>>::Output == Simd<T, LANES>,
sourcefn bitor_assign(&mut self, rhs: U)
fn bitor_assign(&mut self, rhs: U)
Performs the |=
operation. Read more
sourceimpl<'_, T, const LANES: usize> BitXor<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> BitXor<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> BitXor<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> BitXor<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> BitXor<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> BitXor<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> BitXor<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> BitXor<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> BitXor<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> BitXorAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> BitXorAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: BitXor<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as BitXor<U>>::Output == Simd<T, LANES>,
sourcefn bitxor_assign(&mut self, rhs: U)
fn bitxor_assign(&mut self, rhs: U)
Performs the ^=
operation. Read more
sourceimpl<T, const LANES: usize> Clone for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Clone for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> Debug for Simd<T, LANES> where
T: SimdElement + Debug,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Debug for Simd<T, LANES> where
T: SimdElement + Debug,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> Default for Simd<T, LANES> where
T: SimdElement + Default,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Default for Simd<T, LANES> where
T: SimdElement + Default,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'_, T, const LANES: usize> Div<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Div<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> Div<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> Div<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> Div<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Div<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> Div<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Div<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Div<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> DivAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> DivAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Div<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Div<U>>::Output == Simd<T, LANES>,
sourcefn div_assign(&mut self, rhs: U)
fn div_assign(&mut self, rhs: U)
Performs the /=
operation. Read more
sourceimpl<T, const LANES: usize> From<[T; LANES]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> From<[T; LANES]> for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> From<Mask<T, LANES>> for Simd<T, LANES> where
T: MaskElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> From<Mask<T, LANES>> for Simd<T, LANES> where
T: MaskElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> From<Simd<T, LANES>> for [T; LANES] where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> From<Simd<T, LANES>> for [T; LANES] where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> Hash for Simd<T, LANES> where
T: SimdElement + Hash,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Hash for Simd<T, LANES> where
T: SimdElement + Hash,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<I, T, const LANES: usize> Index<I> for Simd<T, LANES> where
T: SimdElement,
I: SliceIndex<[T]>,
LaneCount<LANES>: SupportedLaneCount,
impl<I, T, const LANES: usize> Index<I> for Simd<T, LANES> where
T: SimdElement,
I: SliceIndex<[T]>,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<I, T, const LANES: usize> IndexMut<I> for Simd<T, LANES> where
T: SimdElement,
I: SliceIndex<[T]>,
LaneCount<LANES>: SupportedLaneCount,
impl<I, T, const LANES: usize> IndexMut<I> for Simd<T, LANES> where
T: SimdElement,
I: SliceIndex<[T]>,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> LowerExp for Simd<T, LANES> where
T: SimdElement + LowerExp,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> LowerExp for Simd<T, LANES> where
T: SimdElement + LowerExp,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> LowerHex for Simd<T, LANES> where
T: SimdElement + LowerHex,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> LowerHex for Simd<T, LANES> where
T: SimdElement + LowerHex,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'_, T, const LANES: usize> Mul<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Mul<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> Mul<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> Mul<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> Mul<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Mul<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> Mul<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Mul<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Mul<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> MulAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> MulAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Mul<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Mul<U>>::Output == Simd<T, LANES>,
sourcefn mul_assign(&mut self, rhs: U)
fn mul_assign(&mut self, rhs: U)
Performs the *=
operation. Read more
sourceimpl<const LANES: usize> Neg for Simd<i8, LANES> where
i8: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Neg for Simd<i8, LANES> where
i8: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Neg for Simd<i16, LANES> where
i16: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Neg for Simd<i16, LANES> where
i16: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Neg for Simd<i32, LANES> where
i32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Neg for Simd<i32, LANES> where
i32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Neg for Simd<i64, LANES> where
i64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Neg for Simd<i64, LANES> where
i64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Neg for Simd<f64, LANES> where
f64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Neg for Simd<f64, LANES> where
f64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Neg for Simd<isize, LANES> where
isize: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Neg for Simd<isize, LANES> where
isize: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Neg for Simd<f32, LANES> where
f32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Neg for Simd<f32, LANES> where
f32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<i16, LANES> where
i16: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<i16, LANES> where
i16: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<u16, LANES> where
u16: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<u16, LANES> where
u16: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<usize, LANES> where
usize: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<usize, LANES> where
usize: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<u32, LANES> where
u32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<u32, LANES> where
u32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<u8, LANES> where
u8: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<u8, LANES> where
u8: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<isize, LANES> where
isize: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<isize, LANES> where
isize: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<i32, LANES> where
i32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<i32, LANES> where
i32: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<i8, LANES> where
i8: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<i8, LANES> where
i8: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<u64, LANES> where
u64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<u64, LANES> where
u64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Not for Simd<i64, LANES> where
i64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Not for Simd<i64, LANES> where
i64: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> Octal for Simd<T, LANES> where
T: SimdElement + Octal,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Octal for Simd<T, LANES> where
T: SimdElement + Octal,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> Ord for Simd<T, LANES> where
T: SimdElement + Ord,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Ord for Simd<T, LANES> where
T: SimdElement + Ord,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> PartialEq<Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement + PartialEq<T>,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> PartialEq<Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement + PartialEq<T>,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> PartialOrd<Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement + PartialOrd<T>,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> PartialOrd<Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement + PartialOrd<T>,
LaneCount<LANES>: SupportedLaneCount,
sourcefn partial_cmp(&self, other: &Simd<T, LANES>) -> Option<Ordering>
fn partial_cmp(&self, other: &Simd<T, LANES>) -> Option<Ordering>
This method returns an ordering between self
and other
values if one exists. Read more
1.0.0 · sourcefn lt(&self, other: &Rhs) -> bool
fn lt(&self, other: &Rhs) -> bool
This method tests less than (for self
and other
) and is used by the <
operator. Read more
1.0.0 · sourcefn le(&self, other: &Rhs) -> bool
fn le(&self, other: &Rhs) -> bool
This method tests less than or equal to (for self
and other
) and is used by the <=
operator. Read more
sourceimpl<'a, const LANES: usize> Product<&'a Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Product<&'a Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Product<&'a Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Product<Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Product<Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'_, T, const LANES: usize> Rem<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Rem<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> Rem<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> Rem<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> Rem<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Rem<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> Rem<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Rem<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Rem<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> RemAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> RemAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Rem<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Rem<U>>::Output == Simd<T, LANES>,
sourcefn rem_assign(&mut self, rhs: U)
fn rem_assign(&mut self, rhs: U)
Performs the %=
operation. Read more
sourceimpl<'_, T, const LANES: usize> Shl<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Shl<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> Shl<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> Shl<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> Shl<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Shl<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> Shl<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shl<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shl<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> ShlAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> ShlAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shl<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shl<U>>::Output == Simd<T, LANES>,
sourcefn shl_assign(&mut self, rhs: U)
fn shl_assign(&mut self, rhs: U)
Performs the <<=
operation. Read more
sourceimpl<'_, T, const LANES: usize> Shr<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Shr<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> Shr<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> Shr<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> Shr<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Shr<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> Shr<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Shr<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Shr<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> ShrAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> ShrAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Shr<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Shr<U>>::Output == Simd<T, LANES>,
sourcefn shr_assign(&mut self, rhs: U)
fn shr_assign(&mut self, rhs: U)
Performs the >>=
operation. Read more
sourceimpl<const N: usize> StdFloat for Simd<f64, N> where
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> StdFloat for Simd<f64, N> where
LaneCount<N>: SupportedLaneCount,
sourcefn fract(self) -> Simd<f64, N>
🔬 This is a nightly-only experimental API. (portable_simd
)
fn fract(self) -> Simd<f64, N>
portable_simd
)Returns the floating point’s fractional value, with its integer part removed.
sourcefn mul_add(self, a: Self, b: Self) -> Self
fn mul_add(self, a: Self, b: Self) -> Self
portable_simd
)Fused multiply-add. Computes (self * a) + b
with only one rounding error,
yielding a more accurate result than an unfused multiply-add. Read more
sourcefn sqrt(self) -> Self
fn sqrt(self) -> Self
portable_simd
)Produces a vector where every lane has the square root value
of the equivalently-indexed lane in self
Read more
sourcefn ceil(self) -> Self
fn ceil(self) -> Self
portable_simd
)Returns the smallest integer greater than or equal to each lane.
sourcefn floor(self) -> Self
fn floor(self) -> Self
portable_simd
)Returns the largest integer value less than or equal to each lane.
sourceimpl<const N: usize> StdFloat for Simd<f32, N> where
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> StdFloat for Simd<f32, N> where
LaneCount<N>: SupportedLaneCount,
sourcefn fract(self) -> Simd<f32, N>
🔬 This is a nightly-only experimental API. (portable_simd
)
fn fract(self) -> Simd<f32, N>
portable_simd
)Returns the floating point’s fractional value, with its integer part removed.
sourcefn mul_add(self, a: Self, b: Self) -> Self
fn mul_add(self, a: Self, b: Self) -> Self
portable_simd
)Fused multiply-add. Computes (self * a) + b
with only one rounding error,
yielding a more accurate result than an unfused multiply-add. Read more
sourcefn sqrt(self) -> Self
fn sqrt(self) -> Self
portable_simd
)Produces a vector where every lane has the square root value
of the equivalently-indexed lane in self
Read more
sourcefn ceil(self) -> Self
fn ceil(self) -> Self
portable_simd
)Returns the smallest integer greater than or equal to each lane.
sourcefn floor(self) -> Self
fn floor(self) -> Self
portable_simd
)Returns the largest integer value less than or equal to each lane.
sourceimpl<'_, T, const LANES: usize> Sub<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Sub<&'_ Simd<T, LANES>> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'lhs, 'rhs, T, const LANES: usize> Sub<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'lhs, 'rhs, T, const LANES: usize> Sub<&'rhs Simd<T, LANES>> for &'lhs Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<'_, T, const LANES: usize> Sub<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<Simd<T, LANES>>>::Output == Simd<T, LANES>,
impl<'_, T, const LANES: usize> Sub<Simd<T, LANES>> for &'_ Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<Simd<T, LANES>>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<Simd<T, LANES>>>::Output == Simd<T, LANES>,
sourceimpl<const N: usize> Sub<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<f32, N>> for Simd<f32, N> where
f32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<f64, N>> for Simd<f64, N> where
f64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<i16, N>> for Simd<i16, N> where
i16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<i32, N>> for Simd<i32, N> where
i32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<i64, N>> for Simd<i64, N> where
i64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<i8, N>> for Simd<i8, N> where
i8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<isize, N>> for Simd<isize, N> where
isize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<u16, N>> for Simd<u16, N> where
u16: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<u32, N>> for Simd<u32, N> where
u32: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<u64, N>> for Simd<u64, N> where
u64: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<u8, N>> for Simd<u8, N> where
u8: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<const N: usize> Sub<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
impl<const N: usize> Sub<Simd<usize, N>> for Simd<usize, N> where
usize: SimdElement,
LaneCount<N>: SupportedLaneCount,
sourceimpl<T, U, const LANES: usize> SubAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<U>>::Output == Simd<T, LANES>,
impl<T, U, const LANES: usize> SubAssign<U> for Simd<T, LANES> where
T: SimdElement,
Simd<T, LANES>: Sub<U>,
LaneCount<LANES>: SupportedLaneCount,
<Simd<T, LANES> as Sub<U>>::Output == Simd<T, LANES>,
sourcefn sub_assign(&mut self, rhs: U)
fn sub_assign(&mut self, rhs: U)
Performs the -=
operation. Read more
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<'a, const LANES: usize> Sum<&'a Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<'a, const LANES: usize> Sum<&'a Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<f32, LANES>> for Simd<f32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<f64, LANES>> for Simd<f64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<i16, LANES>> for Simd<i16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<i32, LANES>> for Simd<i32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<i64, LANES>> for Simd<i64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<i8, LANES>> for Simd<i8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<isize, LANES>> for Simd<isize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<u16, LANES>> for Simd<u16, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<u32, LANES>> for Simd<u32, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<u64, LANES>> for Simd<u64, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<u8, LANES>> for Simd<u8, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<const LANES: usize> Sum<Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
impl<const LANES: usize> Sum<Simd<usize, LANES>> for Simd<usize, LANES> where
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> UpperExp for Simd<T, LANES> where
T: SimdElement + UpperExp,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> UpperExp for Simd<T, LANES> where
T: SimdElement + UpperExp,
LaneCount<LANES>: SupportedLaneCount,
sourceimpl<T, const LANES: usize> UpperHex for Simd<T, LANES> where
T: SimdElement + UpperHex,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> UpperHex for Simd<T, LANES> where
T: SimdElement + UpperHex,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Copy for Simd<T, LANES> where
T: SimdElement,
LaneCount<LANES>: SupportedLaneCount,
impl<T, const LANES: usize> Eq for Simd<T, LANES> where
T: SimdElement + Eq,
LaneCount<LANES>: SupportedLaneCount,
Auto Trait Implementations
impl<T, const LANES: usize> RefUnwindSafe for Simd<T, LANES> where
T: RefUnwindSafe,
impl<T, const LANES: usize> Send for Simd<T, LANES> where
T: Send,
impl<T, const LANES: usize> Sync for Simd<T, LANES> where
T: Sync,
impl<T, const LANES: usize> Unpin for Simd<T, LANES> where
T: Unpin,
impl<T, const LANES: usize> UnwindSafe for Simd<T, LANES> where
T: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
sourceimpl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
impl<Q, K> Equivalent<K> for Q where
Q: Eq + ?Sized,
K: Borrow<Q> + ?Sized,
sourcefn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
Compare self to key
and return true
if they are equal.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more