#include "bytecode.h"
#include "syssignal.h"
#include "dynacat.h"
+#include "ent/ent.h"
Lisp_Object Qnil, Qt, Qquote, Qlambda, Qunbound;
Lisp_Object Qerror_conditions, Qerror_message;
Return t if OBJECT is a keyword.
A symbol is a Lisp object with a name. It can optionally have any and all of
-a value, a property list and an associated function.
+a value, a property list and an associated function.
*/
(object))
{
Bufbyte *end, save;
bigq bq;
Lisp_Object result;
-
+
if (*p == '+')
p++;
-
+
end = (Bufbyte*)p;
if (*end == '-')
end++;
*end = '\0';
bigq_init(bq);
-
+
bigq_set_string(bq, (const char *) p, b);
*end = save;
bigq_canonicalize(bq);
{
Bufbyte *end, save;
Lisp_Object retval;
-
+
if (*p == '+')
p++;
end = (Bufbyte*)p;
*/
DEFUN("primep", Fprimep, 1, 2, 0, /*
-Return `nil' if NUMBER is known to be composite, return `t' if
-NUMBER is definitely prime and return 'probably-prime if
+Return `nil' if NUMBER is known to be composite, return `t' if
+NUMBER is definitely prime and return 'probably-prime if
NUMBER seems to be prime but it is not certain.
If optional argument CERTAINTY-THRESHOLD is non-nil, it should be a
bznumber = Fcoerce_number(number, Qbigz, Qnil);
if (NILP(certainty_threshold))
- result = mpz_probab_prime_p(XBIGZ_DATA(bznumber), 8);
+ result = mpz_probab_prime_p(XBIGZ_DATA(bznumber), 8);
else if (NATNUMP(certainty_threshold))
result = mpz_probab_prime_p(XBIGZ_DATA(bznumber),
XINT(certainty_threshold));
DEFUN("perfect-power-p", Fperfect_power_p, 1, 1, 0, /*
Return t if NUMBER is a perfect power, nil otherwise.
-An integer NUMBER is said to be a perfect power if there
+An integer NUMBER is said to be a perfect power if there
exist integers, a and b, such that a^b = NUMBER.
*/
(number))
DEFUN("perfect-square-p", Fperfect_square_p, 1, 1, 0, /*
Return t if NUMBER is a perfect square, nil otherwise.
-An integer NUMBER is said to be a perfect square if there
+An integer NUMBER is said to be a perfect square if there
exists an integer b such that b^2 = NUMBER.
*/
(number))
for (rest2 = XWEAK_LIST(rest)->list;
/* We need to be trickier since we're inside of GC;
- use CONSP instead of !NILP in case of user-visible
- imperfect lists */
+ use CONSP instead of !NILP in case of user-visible
+ imperfect lists */
CONSP(rest2); rest2 = XCDR(rest2)) {
Lisp_Object elem;
/* If the element is "marked" (meaning depends on the type
for (rest2 = XWEAK_LIST(rest)->list, tortoise = rest2;
/* We need to be trickier since we're inside of GC;
- use CONSP instead of !NILP in case of user-visible
- imperfect lists */
+ use CONSP instead of !NILP in case of user-visible
+ imperfect lists */
CONSP(rest2);) {
/* It suffices to check the cons for marking,
regardless of the type of weak list:
`simple' Objects in the list disappear if not pointed to.
`assoc' Objects in the list disappear if they are conses
- and either the car or the cdr of the cons is not
- pointed to.
+ and either the car or the cdr of the cons is not
+ pointed to.
`key-assoc' Objects in the list disappear if they are conses
- and the car is not pointed to.
+ and the car is not pointed to.
`value-assoc' Objects in the list disappear if they are conses
and the cdr is not pointed to.
`full-assoc' Objects in the list disappear if they are conses