1 /* Copyright (C) 1995,1996,1997,1998,2000,2001 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. */
44 #include "libguile/_scm.h"
45 #include "libguile/ramap.h"
46 #include "libguile/stackchk.h"
47 #include "libguile/strorder.h"
48 #include "libguile/async.h"
49 #include "libguile/root.h"
50 #include "libguile/smob.h"
51 #include "libguile/unif.h"
52 #include "libguile/vectors.h"
54 #include "libguile/validate.h"
55 #include "libguile/eq.h"
57 SCM_DEFINE1 (scm_eq_p
, "eq?", scm_tc7_rpsubr
,
59 "Return @code{#t} iff @var{x} references the same object as @var{y}.\n"
60 "@code{eq?} is similar to @code{eqv?} except that in some cases it is\n"
61 "capable of discerning distinctions finer than those detectable by\n"
63 #define FUNC_NAME s_scm_eq_p
65 return SCM_BOOL (SCM_EQ_P (x
, y
));
70 SCM_DEFINE1 (scm_eqv_p
, "eqv?", scm_tc7_rpsubr
,
72 "The @code{eqv?} procedure defines a useful equivalence relation on objects.\n"
73 "Briefly, it returns @code{#t} if @var{x} and @var{y} should normally be\n"
74 "regarded as the same object. This relation is left slightly open to\n"
75 "interpretation, but works for comparing immediate integers, characters,\n"
76 "and inexact numbers.")
77 #define FUNC_NAME s_scm_eqv_p
85 /* this ensures that types and scm_length are the same. */
86 if (SCM_CELL_TYPE (x
) != SCM_CELL_TYPE (y
))
88 /* treat mixes of real and complex types specially */
89 if (SCM_SLOPPY_INEXACTP (x
))
91 if (SCM_SLOPPY_REALP (x
))
92 return SCM_BOOL (SCM_SLOPPY_COMPLEXP (y
)
93 && SCM_REAL_VALUE (x
) == SCM_COMPLEX_REAL (y
)
94 && 0.0 == SCM_COMPLEX_IMAG (y
));
96 return SCM_BOOL (SCM_SLOPPY_REALP (y
)
97 && SCM_COMPLEX_REAL (x
) == SCM_REAL_VALUE (y
)
98 && SCM_COMPLEX_IMAG (x
) == 0.0);
105 return SCM_BOOL (0 == scm_bigcomp (x
, y
));
106 } else if (SCM_SLOPPY_REALP (x
)) {
107 return SCM_BOOL (SCM_REAL_VALUE (x
) == SCM_REAL_VALUE (y
));
108 } else { /* complex */
109 return SCM_BOOL (SCM_COMPLEX_REAL (x
) == SCM_COMPLEX_REAL (y
)
110 && SCM_COMPLEX_IMAG (x
) == SCM_COMPLEX_IMAG (y
));
118 SCM_DEFINE1 (scm_equal_p
, "equal?", scm_tc7_rpsubr
,
120 "Return @code{#t} iff @var{x} and @var{y} are recursively @code{eqv?} equivalent.\n"
121 "@code{equal?} recursively compares the contents of pairs,\n"
122 "vectors, and strings, applying @code{eqv?} on other objects such as\n"
123 "numbers and symbols. A rule of thumb is that objects are generally\n"
124 "@code{equal?} if they print the same. @code{equal?} may fail to\n"
125 "terminate if its arguments are circular data structures.")
126 #define FUNC_NAME s_scm_equal_p
137 if (SCM_CONSP (x
) && SCM_CONSP (y
))
139 if (SCM_FALSEP (scm_equal_p (SCM_CAR (x
), SCM_CAR (y
))))
145 if (SCM_TYP7S (x
) == scm_tc7_string
&& SCM_TYP7S (y
) == scm_tc7_string
)
146 return scm_string_equal_p (x
, y
);
147 /* This ensures that types and scm_length are the same. */
148 if (SCM_CELL_TYPE (x
) != SCM_CELL_TYPE (y
))
150 /* treat mixes of real and complex types specially */
151 if (SCM_SLOPPY_INEXACTP (x
))
153 if (SCM_SLOPPY_REALP (x
))
154 return SCM_BOOL (SCM_SLOPPY_COMPLEXP (y
)
155 && SCM_REAL_VALUE (x
) == SCM_COMPLEX_REAL (y
)
156 && 0.0 == SCM_COMPLEX_IMAG (y
));
158 return SCM_BOOL (SCM_SLOPPY_REALP (y
)
159 && SCM_COMPLEX_REAL (x
) == SCM_REAL_VALUE (y
)
160 && SCM_COMPLEX_IMAG (x
) == 0.0);
164 switch (SCM_TYP7 (x
))
170 return scm_vector_equal_p (x
, y
);
173 int i
= SCM_SMOBNUM (x
);
174 if (!(i
< scm_numsmob
))
176 if (scm_smobs
[i
].equalp
)
177 return (scm_smobs
[i
].equalp
) (x
, y
);
182 case scm_tc7_bvect
: case scm_tc7_uvect
: case scm_tc7_ivect
:
183 case scm_tc7_fvect
: case scm_tc7_cvect
: case scm_tc7_dvect
:
185 #ifdef HAVE_LONG_LONGS
189 if (scm_tc16_array
&& scm_smobs
[SCM_TC2SMOBNUM (scm_tc16_array
)].equalp
)
190 return scm_array_equal_p (x
, y
);
205 #ifndef SCM_MAGIC_SNARFER
206 #include "libguile/eq.x"