Efficient FIFO Buffer for own algorithm

[muhkuhns]

Hello,

I need a FIFO buffer for at least 20 arrays with 8 int32 in each... for use in an algorithm.. is there a more elegant way than just copying them all around each time?

I need this:

char array[5] = {a,b,c,d,e}
-> f (new value received)
[b,c,d,e,f]
-> g
[c,d,e,f,g]

but want to avoid doing it somehow like this:

for (int i=0; i<4; i++) {
array[i]=array[i+1];
}
array[4]=new_value

[Kevin K.]

Yes, you want something like a circular buffer (also called a ring buffer). See www.embedded.com/.../The-ring-buffer