50 lines
626 B
C++
50 lines
626 B
C++
|
#include "stdafx.h"
|
||
|
|
#include "defs.h"
|
||
|
|
|
||
|
|
void
|
||
|
|
eval_isprime(void)
|
||
|
|
{
|
||
|
|
int t;
|
||
|
|
push(cadr(p1));
|
||
|
|
eval();
|
||
|
|
p1 = pop();
|
||
|
|
if (isnonnegativeinteger(p1)) {
|
||
|
|
t = mprime(p1->u.q.a);
|
||
|
|
push_integer(t);
|
||
|
|
} else
|
||
|
|
stop("isprime: nonnegative integer arg expected");
|
||
|
|
}
|
||
|
|
|
||
|
|
static char *s[] = {
|
||
|
|
|
||
|
|
"isprime(13)",
|
||
|
|
"1",
|
||
|
|
|
||
|
|
"isprime(14)",
|
||
|
|
"0",
|
||
|
|
|
||
|
|
// from the Prime Curios web page
|
||
|
|
|
||
|
|
"isprime(9007199254740991)",
|
||
|
|
"0",
|
||
|
|
|
||
|
|
// The largest prime that JavaScript supports
|
||
|
|
|
||
|
|
"isprime(2^53 - 111)",
|
||
|
|
"1",
|
||
|
|
|
||
|
|
// misc. primes
|
||
|
|
|
||
|
|
"isprime(2^50-71)",
|
||
|
|
"1",
|
||
|
|
|
||
|
|
"isprime(2^40-87)",
|
||
|
|
"1",
|
||
|
|
};
|
||
|
|
|
||
|
|
void
|
||
|
|
test_isprime(void)
|
||
|
|
{
|
||
|
|
test(__FILE__, s, sizeof s / sizeof (char *));
|
||
|
|
}
|