isprime.cpp

   1 #include "stdafx.h"
   2 #include "defs.h"
   3
   4 void
   5 eval_isprime(void)
   6 {
   7         push(cadr(p1));
   8         eval();
   9         p1 = pop();
  10         if (isnonnegativeinteger(p1) && mprime(p1->u.q.a))
  11                 push_integer(1);
  12         else
  13                 push_integer(0);
  14 }
  15
  16 #if SELFTEST
  17
  18 static char *s[] = {
  19
  20         // 0 and 1 are not prime numbers
  21
  22         "isprime(0)",
  23         "0",
  24
  25         "isprime(1)",
  26         "0",
  27
  28         "isprime(13)",
  29         "1",
  30
  31         "isprime(14)",
  32         "0",
  33
  34         // from the Prime Curios web page
  35
  36         "isprime(9007199254740991)",
  37         "0",
  38
  39         // The largest prime that JavaScript supports
  40
  41         "isprime(2^53 - 111)",
  42         "1",
  43
  44         // misc. primes
  45
  46         "isprime(2^50-71)",
  47         "1",
  48
  49         "isprime(2^40-87)",
  50         "1",
  51 };
  52
  53 void
  54 test_isprime(void)
  55 {
  56         test(__FILE__, s, sizeof s / sizeof (char *));
  57 }
  58
  59 #endif