I'm writing a FIR filter that is supposed to calculate running average of an input sequence.
class RunningAverager
{
public:
RunningAverager(uint64_t FilterOrder)
{
for (uint64_t i=0; i<FilterOrder; i++)
{
Registers.push(0);
}
}
uint64_t GetAverage(uint64_t NewInput)
{
Registers.push(NewInput);
Registers.pop();
return GetAverage();
}
uint64_t GetAverage() const
{
uint64_t Sum = 0;
//for (uint64_t i=0; i<Registers.size(); i++) <-- Works
for (std::stack<uint64_t>::const_reference ref=Registers.begin(); ref!=Registers.end(); ???)
{ // begin() and end() methods do not exist for std::stack
//Sum += Registers[i]; Doesn't work, because the [] operator is not overloaded.
Sum += ref;
}
return Sum / Registers.size();
}
private:
std::stack<uint64_t> Registers;
};
I am having trouble iterating the std::stack
object Registers
. Unlike other STL containers, it doesn't give an iterator or random access operator.
How do I loop and std::stack
object?
An example usage:
RunningAverager ra(10);
while(...)
{
FilteredSpeed = ra.GetAverage(ActualSpeed);
}
You could use a std::deque
in place of a stack, using push_front
and pop_front
.