6502/CLK
1
0
Fork 0
mirror of https://github.com/TomHarte/CLK.git synced 2026-01-23 01:16:10 +00:00
Code Issues Projects Releases Wiki Activity

Move to centralised apply_to iterator management.

Browse Source
This commit is contained in:
Thomas Harte
2026-01-13 22:49:41 -05:00
parent a3ef460334
commit c4a1f2e5a7
2 changed files with 61 additions and 56 deletions
Download Patch File Download Diff File Expand all files Collapse all files

41
SignalProcessing/FIRFilter.hpp
View File

@@ -19,6 +19,7 @@
#include <algorithm>
#include <cassert>
#include <cmath>
#include <iterator>
#include <numeric>
#include <vector>
@@ -125,20 +126,38 @@ public:
return coefficients_.size();
}
FIRFilter &resize(const size_t size) {
assert(size & 1);
template <typename IteratorT>
void copy_to(
IteratorT begin,
IteratorT end,
const std::function<void(IteratorT, CoefficientType)> &applier
) const {
auto dest = begin;
auto src = coefficients_.begin();
if(size >= coefficients_.size()) {
// TODO: find a faster solution than this.
const auto half_difference = (size - coefficients_.size()) / 2;
std::vector<CoefficientType> zeroes(half_difference);
coefficients_.insert(coefficients_.begin(), zeroes.begin(), zeroes.end());
coefficients_.insert(coefficients_.end(), zeroes.begin(), zeroes.end());
return *this;
const auto destination_size = size_t(std::distance(begin, end));
if(destination_size <= coefficients_.size()) {
std::advance(src, (coefficients_.size() - destination_size) / 2);
} else {
std::advance(dest, (destination_size - coefficients_.size()) / 2);
}
// const auto total = std::accumulate(coefficients_.begin(), coefficients_.end(), CoefficientType{});
return *this;
auto steps = std::min(destination_size, coefficients_.size());
while(steps--) {
applier(dest, *src);
++dest;
++src;
}
}
template <typename IteratorT>
void copy_to(
const IteratorT begin,
const IteratorT end
) const {
copy_to(begin, end, [](const IteratorT target, const CoefficientType coefficient) {
*target = coefficient;
});
}
private: