Mail Archives: djgpp/1998/07/27/12:30:16
Hello. I was just considering the case of a circular
buffer. Indexing the subscripts could be done with
something like this:
/* subscripts: "front" is subscript of first stored value
"back" is subscript of last stored value
"last" is subscript of the last available
array spot */
front = (front + 1 > last) ? 0 : front + 1;
back = (back + 1 > last) ? 0 : back + 1;
...or you could say:
front = (++front) % last;
back = (++back) % last;
...which begs the question, "How fast is the modulo?"
and more specifically, how is it implemented?
Thanks,
--Ed
- Raw text -