int is_palindrome(unsigned n)
{
char number[20];
int i, j;
snprintf(number, 10, "%d", n);
i = alen(number) - 1;
for (j = 0; j < i / 2 + 1; j++)
if (!(number[j] == number[i-j]))
return 0;
return 1;
}
void
testrand(void *arg)
{
Chan *reply;
size_t i;
int j;
ulong r;
procsetname("testrand");
reply = arg;
for(i = 0; i < alen(tests); i++){
procsrand(tests[i].seed);
for(j = 0; j < Nrand; j++){
r = procrand();
if(r != tests[i].expect[j]){
printf("fail: (seed %lu, j %d) -- expected %lu got %lu\n", tests[i].seed,
j, tests[i].expect[j], r);
chansend(reply, &(int){1});
}
}
