diff options
author | Chris Robinson <[email protected]> | 2023-09-22 12:47:29 -0700 |
---|---|---|
committer | Chris Robinson <[email protected]> | 2023-09-22 12:47:29 -0700 |
commit | bc5b58464ce52097efdb53c8019ba048e7ee3ba8 (patch) | |
tree | 828ca94803219f30a25b68e826e6b2d1513b7bdf /common/alcomplex.cpp | |
parent | 6f33ba65d6470a99dac860dcd8472d47370be77f (diff) |
Shift the appropriate type
Diffstat (limited to 'common/alcomplex.cpp')
-rw-r--r-- | common/alcomplex.cpp | 8 |
1 files changed, 4 insertions, 4 deletions
diff --git a/common/alcomplex.cpp b/common/alcomplex.cpp index ee990a39..dad62d0a 100644 --- a/common/alcomplex.cpp +++ b/common/alcomplex.cpp @@ -127,8 +127,8 @@ complex_fft(const al::span<std::complex<Real>> buffer, const al::type_identity_t /* Iterative form of Danielson-Lanczos lemma */ for(size_t i{0};i < log2_size;++i) { - const size_t step2{1u << i}; - const size_t step{2u << i}; + const size_t step2{1_uz << i}; + const size_t step{2_uz << i}; /* The first iteration of the inner loop would have u=1, which we * can simplify to remove a number of complex multiplies. */ @@ -172,8 +172,8 @@ complex_fft(const al::span<std::complex<Real>> buffer, const al::type_identity_t const Real pi{al::numbers::pi_v<Real> * sign}; for(size_t i{0};i < log2_size;++i) { - const size_t step2{1u << i}; - const size_t step{2u << i}; + const size_t step2{1_uz << i}; + const size_t step{2_uz << i}; for(size_t k{0};k < fftsize;k+=step) { std::complex<Real> temp{buffer[k+step2]}; |