I suppose this one would work too, but this one
requires that the rollover value be no more than half the maximum value of a 16-bit unsigned word. Also, because it gets so close to actual U16 rollover, there's a chance that the value will truly roll over without being caught at the desired value. (To make sure this is a feasible challenge, I'm going with the assumption that there will be no jump in value greater that half the rollover limit).
Again, for those that might not be familar with all the symbols, that division thing with the
R and the
IQ is a quotient function. It gives the quotient
IQ and the remainder
R. The triangles with the
? T F on them are boolean selectors; it selects the value wired to
T or
F according to the boolean input (the
? symbol). Lastly, that green arrow there is a feedback node; it holds a value until the next call. This one happens to be green (boolean).
And I believe you can figure the rest out.
Thanks again!