| 184 | } |
| 185 | |
| 186 | static word Increment(word *A, unsigned int N, word B=1) |
| 187 | { |
| 188 | assert(N); |
| 189 | word t = A[0]; |
| 190 | A[0] = t+B; |
| 191 | if (A[0] >= t) |
| 192 | return 0; |
| 193 | for (unsigned i=1; i<N; i++) |
| 194 | if (++A[i]) |
| 195 | return 0; |
| 196 | return 1; |
| 197 | } |
| 198 | |
| 199 | static word Decrement(word *A, unsigned int N, word B=1) |
| 200 | { |
no outgoing calls
no test coverage detected