[−][src]Type Definition packed_simd::i16x2
type i16x2 = Simd<[i16; 2]>;
A 32-bit vector with 2 i16 lanes.
Methods
impl i16x2[src][−]
pub const fn new(x0: i16, x1: i16) -> Self[src][−]
Creates a new instance with each vector elements initialized with the provided values.
pub const fn lanes() -> usize[src][−]
Returns the number of vector lanes.
pub const fn splat(value: i16) -> Self[src][−]
Constructs a new instance with each element initialized to
value.
pub fn extract(self, index: usize) -> i16[src][−]
pub unsafe fn extract_unchecked(self, index: usize) -> i16[src][−]
pub fn replace(self, index: usize, new_value: i16) -> Self[src][−]
Returns a new vector where the value at index is replaced by new_value.
Panics
If index >= Self::lanes().
pub unsafe fn replace_unchecked(self, index: usize, new_value: i16) -> Self[src][−]
Returns a new vector where the value at index is replaced by new_value.
Precondition
If index >= Self::lanes() the behavior is undefined.
impl i16x2[src][−]
pub fn rotate_left(self, n: i16x2) -> i16x2[src][−]
Shifts the bits of each lane to the left by the specified
amount in the corresponding lane of n, wrapping the
truncated bits to the end of the resulting integer.
Note: this is neither the same operation as << nor equivalent
to slice::rotate_left.
pub fn rotate_right(self, n: i16x2) -> i16x2[src][−]
Shifts the bits of each lane to the right by the specified
amount in the corresponding lane of n, wrapping the
truncated bits to the beginning of the resulting integer.
Note: this is neither the same operation as << nor equivalent
to slice::rotate_left.
impl i16x2[src][−]
pub fn min(self, x: Self) -> Self[src][−]
Minimum of two vectors.
Returns a new vector containing the minimum value of each of the input vector lanes.
pub fn max(self, x: Self) -> Self[src][−]
Maximum of two vectors.
Returns a new vector containing the maximum value of each of the input vector lanes.
impl i16x2[src][−]
pub fn wrapping_sum(self) -> i16[src][−]
Horizontal wrapping sum of the vector elements.
The intrinsic performs a tree-reduction of the vector elements. That is, for an 8 element vector:
((x0 + x1) + (x2 + x3)) + ((x4 + x5) + (x6 + x7))
If an operation overflows it returns the mathematical result
modulo 2^n where n is the number of times it overflows.
pub fn wrapping_product(self) -> i16[src][−]
Horizontal wrapping product of the vector elements.
The intrinsic performs a tree-reduction of the vector elements. That is, for an 8 element vector:
((x0 * x1) * (x2 * x3)) * ((x4 * x5) * (x6 * x7))
If an operation overflows it returns the mathematical result
modulo 2^n where n is the number of times it overflows.
impl i16x2[src][−]
pub fn max_element(self) -> i16[src][−]
Largest vector element value.
pub fn min_element(self) -> i16[src][−]
Smallest vector element value.
impl i16x2[src][−]
pub fn and(self) -> i16[src][−]
Lane-wise bitwise and of the vector elements.
Note: if the vector has one lane, the first element of the vector is returned.
pub fn or(self) -> i16[src][−]
Lane-wise bitwise or of the vector elements.
Note: if the vector has one lane, the first element of the vector is returned.
pub fn xor(self) -> i16[src][−]
Lane-wise bitwise xor of the vector elements.
Note: if the vector has one lane, the first element of the vector is returned.
impl i16x2[src][−]
pub fn from_slice_aligned(slice: &[i16]) -> Self[src][−]
Instantiates a new vector with the values of the slice.
Panics
If slice.len() < Self::lanes() or &slice[0] is not aligned
to an align_of::<Self>() boundary.
pub fn from_slice_unaligned(slice: &[i16]) -> Self[src][−]
pub unsafe fn from_slice_aligned_unchecked(slice: &[i16]) -> Self[src][−]
Instantiates a new vector with the values of the slice.
Precondition
If slice.len() < Self::lanes() or &slice[0] is not aligned
to an align_of::<Self>() boundary, the behavior is undefined.
pub unsafe fn from_slice_unaligned_unchecked(slice: &[i16]) -> Self[src][−]
Instantiates a new vector with the values of the slice.
Precondition
If slice.len() < Self::lanes() the behavior is undefined.
impl i16x2[src][−]
pub fn write_to_slice_aligned(self, slice: &mut [i16])[src][−]
Writes the values of the vector to the slice.
Panics
If slice.len() < Self::lanes() or &slice[0] is not
aligned to an align_of::<Self>() boundary.
pub fn write_to_slice_unaligned(self, slice: &mut [i16])[src][−]
pub unsafe fn write_to_slice_aligned_unchecked(self, slice: &mut [i16])[src][−]
Writes the values of the vector to the slice.
Precondition
If slice.len() < Self::lanes() or &slice[0] is not
aligned to an align_of::<Self>() boundary, the behavior is
undefined.
pub unsafe fn write_to_slice_unaligned_unchecked(self, slice: &mut [i16])[src][−]
Writes the values of the vector to the slice.
Precondition
If slice.len() < Self::lanes() the behavior is undefined.
impl i16x2[src][−]
pub fn swap_bytes(self) -> Self[src][−]
Reverses the byte order of the vector.
pub fn to_le(self) -> Self[src][−]
Converts self to little endian from the target's endianness.
On little endian this is a no-op. On big endian the bytes are swapped.
pub fn to_be(self) -> Self[src][−]
Converts self to big endian from the target's endianness.
On big endian this is a no-op. On little endian the bytes are swapped.
pub fn from_le(x: Self) -> Self[src][−]
Converts a vector from little endian to the target's endianness.
On little endian this is a no-op. On big endian the bytes are swapped.
pub fn from_be(x: Self) -> Self[src][−]
Converts a vector from big endian to the target's endianness.
On big endian this is a no-op. On little endian the bytes are swapped.
impl i16x2[src][−]
pub fn count_ones(self) -> Self[src][−]
Returns the number of ones in the binary representation of
the lanes of self.
pub fn count_zeros(self) -> Self[src][−]
Returns the number of zeros in the binary representation of
the lanes of self.
pub fn leading_zeros(self) -> Self[src][−]
Returns the number of leading zeros in the binary
representation of the lanes of self.
pub fn trailing_zeros(self) -> Self[src][−]
Returns the number of trailing zeros in the binary
representation of the lanes of self.
impl i16x2[src][−]
pub fn shuffle1_dyn<I>(self, indices: I) -> Self where
Self: Shuffle1Dyn<Indices = I>, [src][−]
Self: Shuffle1Dyn<Indices = I>,
Shuffle vector elements according to indices.
impl i16x2[src][−]
pub fn eq(self, other: Self) -> m16x2[src][−]
Lane-wise equality comparison.
pub fn ne(self, other: Self) -> m16x2[src][−]
Lane-wise inequality comparison.
pub fn lt(self, other: Self) -> m16x2[src][−]
Lane-wise less-than comparison.
pub fn le(self, other: Self) -> m16x2[src][−]
Lane-wise less-than-or-equals comparison.
pub fn gt(self, other: Self) -> m16x2[src][−]
Lane-wise greater-than comparison.
pub fn ge(self, other: Self) -> m16x2[src][−]
Lane-wise greater-than-or-equals comparison.
impl i16x2[src][−]
pub fn partial_lex_ord(&self) -> LexicographicallyOrdered<i16x2>[src][−]
Returns a wrapper that implements PartialOrd.
impl i16x2[src][−]
pub fn lex_ord(&self) -> LexicographicallyOrdered<i16x2>[src][−]
Returns a wrapper that implements Ord.
impl i16x2[src][−]
pub fn bitmask(self) -> u8[src][−]
Creates a bitmask with the MSB of each vector lane.
If the vector has less than 8 lanes, the bits that do not correspond to any vector lanes are cleared.