1 /* Copyright (C) 1995,1996,1997,1998,2000,2001, 2003 Free Software Foundation, Inc.
3 * This program is free software; you can redistribute it and/or modify
4 * it under the terms of the GNU General Public License as published by
5 * the Free Software Foundation; either version 2, or (at your option)
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 * GNU General Public License for more details.
13 * You should have received a copy of the GNU General Public License
14 * along with this software; see the file COPYING. If not, write to
15 * the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
16 * Boston, MA 02111-1307 USA
18 * As a special exception, the Free Software Foundation gives permission
19 * for additional uses of the text contained in its release of GUILE.
21 * The exception is that, if you link the GUILE library with other files
22 * to produce an executable, this does not by itself cause the
23 * resulting executable to be covered by the GNU General Public License.
24 * Your use of that executable is in no way restricted on account of
25 * linking the GUILE library code into it.
27 * This exception does not however invalidate any other reasons why
28 * the executable file might be covered by the GNU General Public License.
30 * This exception applies only to the code released by the
31 * Free Software Foundation under the name GUILE. If you copy
32 * code from other Free Software Foundation releases into a copy of
33 * GUILE, as the General Public License permits, the exception does
34 * not apply to the code that you add in this way. To avoid misleading
35 * anyone as to the status of such modified files, you must delete
36 * this exception notice from them.
38 * If you write modifications of your own for GUILE, it is your choice
39 * whether to permit this exception to apply to your modifications.
40 * If you do not wish that, delete this exception notice. */
47 #include "libguile/_scm.h"
48 #include "libguile/ramap.h"
49 #include "libguile/stackchk.h"
50 #include "libguile/strorder.h"
51 #include "libguile/async.h"
52 #include "libguile/root.h"
53 #include "libguile/smob.h"
54 #include "libguile/unif.h"
55 #include "libguile/vectors.h"
57 #include "libguile/validate.h"
58 #include "libguile/eq.h"
66 SCM_DEFINE1 (scm_eq_p
, "eq?", scm_tc7_rpsubr
,
68 "Return @code{#t} iff @var{x} references the same object as @var{y}.\n"
69 "@code{eq?} is similar to @code{eqv?} except that in some cases it is\n"
70 "capable of discerning distinctions finer than those detectable by\n"
72 #define FUNC_NAME s_scm_eq_p
74 return SCM_BOOL (SCM_EQ_P (x
, y
));
78 /* We compare doubles in a special way for 'eqv?' to be able to
79 distinguish plus and minus zero and to identify NaNs.
83 real_eqv (double x
, double y
)
85 return !memcmp (&x
, &y
, sizeof(double));
88 SCM_DEFINE1 (scm_eqv_p
, "eqv?", scm_tc7_rpsubr
,
90 "The @code{eqv?} procedure defines a useful equivalence relation on objects.\n"
91 "Briefly, it returns @code{#t} if @var{x} and @var{y} should normally be\n"
92 "regarded as the same object. This relation is left slightly open to\n"
93 "interpretation, but works for comparing immediate integers, characters,\n"
94 "and inexact numbers.")
95 #define FUNC_NAME s_scm_eqv_p
103 /* this ensures that types and scm_length are the same. */
104 if (SCM_CELL_TYPE (x
) != SCM_CELL_TYPE (y
))
106 /* treat mixes of real and complex types specially */
107 if (SCM_SLOPPY_INEXACTP (x
))
109 if (SCM_SLOPPY_REALP (x
))
110 return SCM_BOOL (SCM_SLOPPY_COMPLEXP (y
)
111 && real_eqv (SCM_REAL_VALUE (x
),
112 SCM_COMPLEX_REAL (y
))
113 && 0.0 == SCM_COMPLEX_IMAG (y
));
115 return SCM_BOOL (SCM_SLOPPY_REALP (y
)
116 && real_eqv (SCM_COMPLEX_REAL (x
),
118 && SCM_COMPLEX_IMAG (x
) == 0.0);
125 return SCM_BOOL (0 == scm_i_bigcmp (x
, y
));
126 } else if (SCM_SLOPPY_REALP (x
)) {
127 return SCM_BOOL (real_eqv (SCM_REAL_VALUE (x
), SCM_REAL_VALUE (y
)));
128 } else { /* complex */
129 return SCM_BOOL (real_eqv (SCM_COMPLEX_REAL (x
),
130 SCM_COMPLEX_REAL (y
))
131 && real_eqv (SCM_COMPLEX_IMAG (x
),
132 SCM_COMPLEX_IMAG (y
)));
140 SCM_PRIMITIVE_GENERIC_1 (scm_equal_p
, "equal?", scm_tc7_rpsubr
,
142 "Return @code{#t} iff @var{x} and @var{y} are recursively @code{eqv?} equivalent.\n"
143 "@code{equal?} recursively compares the contents of pairs,\n"
144 "vectors, and strings, applying @code{eqv?} on other objects such as\n"
145 "numbers and symbols. A rule of thumb is that objects are generally\n"
146 "@code{equal?} if they print the same. @code{equal?} may fail to\n"
147 "terminate if its arguments are circular data structures.")
148 #define FUNC_NAME s_scm_equal_p
159 if (SCM_CONSP (x
) && SCM_CONSP (y
))
161 if (SCM_FALSEP (scm_equal_p (SCM_CAR (x
), SCM_CAR (y
))))
167 if (SCM_TYP7S (x
) == scm_tc7_string
&& SCM_TYP7S (y
) == scm_tc7_string
)
168 return scm_string_equal_p (x
, y
);
169 /* This ensures that types and scm_length are the same. */
170 if (SCM_CELL_TYPE (x
) != SCM_CELL_TYPE (y
))
172 /* treat mixes of real and complex types specially */
173 if (SCM_SLOPPY_INEXACTP (x
))
175 if (SCM_SLOPPY_REALP (x
))
176 return SCM_BOOL (SCM_SLOPPY_COMPLEXP (y
)
177 && SCM_REAL_VALUE (x
) == SCM_COMPLEX_REAL (y
)
178 && 0.0 == SCM_COMPLEX_IMAG (y
));
180 return SCM_BOOL (SCM_SLOPPY_REALP (y
)
181 && SCM_COMPLEX_REAL (x
) == SCM_REAL_VALUE (y
)
182 && SCM_COMPLEX_IMAG (x
) == 0.0);
186 switch (SCM_TYP7 (x
))
192 return scm_vector_equal_p (x
, y
);
195 int i
= SCM_SMOBNUM (x
);
196 if (!(i
< scm_numsmob
))
198 if (scm_smobs
[i
].equalp
)
199 return (scm_smobs
[i
].equalp
) (x
, y
);
204 case scm_tc7_bvect
: case scm_tc7_uvect
: case scm_tc7_ivect
:
205 case scm_tc7_fvect
: case scm_tc7_cvect
: case scm_tc7_dvect
:
207 #if SCM_SIZEOF_LONG_LONG != 0
211 if (scm_tc16_array
&& scm_smobs
[SCM_TC2SMOBNUM (scm_tc16_array
)].equalp
)
212 return scm_array_equal_p (x
, y
);
215 if (SCM_UNPACK (g_scm_equal_p
))
216 return scm_call_generic_2 (g_scm_equal_p
, x
, y
);
230 #include "libguile/eq.x"