d(N,X) == NdX == dX+dX+...+dX N times; n <= d(n,x) <= (n*x) */
| 172 | |
| 173 | /* d(N,X) == NdX == dX+dX+...+dX N times; n <= d(n,x) <= (n*x) */ |
| 174 | int |
| 175 | d(int n, int x) |
| 176 | { |
| 177 | int tmp = n; |
| 178 | |
| 179 | #if (NH_DEVEL_STATUS != NH_STATUS_RELEASED) |
| 180 | if (x < 0 || n < 0 || (x == 0 && n != 0)) { |
| 181 | impossible("d(%d,%d) attempted", n, x); |
| 182 | return 1; |
| 183 | } |
| 184 | #endif |
| 185 | while (n--) |
| 186 | tmp += RND(x); |
| 187 | return tmp; /* Alea iacta est. -- J.C. */ |
| 188 | } |
| 189 | |
| 190 | /* 1 <= rne(x) <= max(u.ulevel/3,5) */ |
| 191 | int |
no test coverage detected