1 //! This module hacks in "implicit deref" for Simd's operators.
2 //! Ideally, Rust would take care of this itself,
3 //! and method calls usually handle the LHS implicitly.
4 //! But this is not the case with arithmetic ops.
7 macro_rules! deref_lhs {
8 (impl<T, const LANES: usize> $trait:ident for $simd:ty {
11 impl<T, const LANES: usize> $trait<$simd> for &$simd
14 $simd: $trait<$simd, Output = $simd>,
15 LaneCount<LANES>: SupportedLaneCount,
17 type Output = Simd<T, LANES>;
20 #[must_use = "operator returns a new vector without mutating the inputs"]
21 fn $call(self, rhs: $simd) -> Self::Output {
28 macro_rules! deref_rhs {
29 (impl<T, const LANES: usize> $trait:ident for $simd:ty {
32 impl<T, const LANES: usize> $trait<&$simd> for $simd
35 $simd: $trait<$simd, Output = $simd>,
36 LaneCount<LANES>: SupportedLaneCount,
38 type Output = Simd<T, LANES>;
41 #[must_use = "operator returns a new vector without mutating the inputs"]
42 fn $call(self, rhs: &$simd) -> Self::Output {
49 macro_rules! deref_ops {
50 ($(impl<T, const LANES: usize> $trait:ident for $simd:ty {
55 impl<T, const LANES: usize> $trait for $simd {
60 impl<T, const LANES: usize> $trait for $simd {
64 impl<'lhs, 'rhs, T, const LANES: usize> $trait<&'rhs $simd> for &'lhs $simd
67 $simd: $trait<$simd, Output = $simd>,
68 LaneCount<LANES>: SupportedLaneCount,
73 #[must_use = "operator returns a new vector without mutating the inputs"]
74 fn $call(self, rhs: &$simd) -> Self::Output {
84 impl<T, const LANES: usize> Add for Simd<T, LANES> {
88 impl<T, const LANES: usize> Mul for Simd<T, LANES> {
92 impl<T, const LANES: usize> Sub for Simd<T, LANES> {
96 impl<T, const LANES: usize> Div for Simd<T, LANES> {
100 impl<T, const LANES: usize> Rem for Simd<T, LANES> {
105 impl<T, const LANES: usize> BitAnd for Simd<T, LANES> {
109 impl<T, const LANES: usize> BitOr for Simd<T, LANES> {
113 impl<T, const LANES: usize> BitXor for Simd<T, LANES> {
117 impl<T, const LANES: usize> Shl for Simd<T, LANES> {
121 impl<T, const LANES: usize> Shr for Simd<T, LANES> {