1 /* Copyright (C) 1995,1996,1997 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. */
42 /* Software engineering face-lift by Greg J. Badros, 11-Dec-1999,
43 gjb@cs.washington.edu, http://www.cs.washington.edu/homes/gjb */
56 extern double floor();
61 scm_hasher(SCM obj
, unsigned long n
, scm_sizet d
)
63 switch (7 & (int) obj
) {
66 return SCM_INUM(obj
) % n
; /* SCM_INUMP(obj) */
69 return (unsigned)(scm_downcase(SCM_CHAR(obj
))) % n
;
76 case (int) SCM_BOOL_T
:
79 case (int) SCM_BOOL_F
:
82 case (int) SCM_EOF_VAL
:
86 d
= 263; /* perhaps should be error */
90 return 263 % n
; /* perhaps should be error */
92 switch SCM_TYP7(obj
) {
96 switch SCM_TYP16(obj
) {
98 return SCM_INUM(scm_modulo(obj
, SCM_MAKINUM(n
)));
104 double r
= SCM_REALPART(obj
);
106 obj
= scm_inexact_to_exact (obj
);
107 if SCM_IMP(obj
) return SCM_INUM(obj
) % n
;
108 return SCM_INUM(scm_modulo(obj
, SCM_MAKINUM(n
)));
111 obj
= scm_number_to_string(obj
, SCM_MAKINUM(10));
114 case scm_tcs_symbols
:
116 case scm_tc7_substring
:
117 return scm_strhash(SCM_ROUCHARS(obj
), (scm_sizet
) SCM_ROLENGTH(obj
), n
);
121 scm_sizet len
= SCM_LENGTH(obj
);
122 SCM
*data
= SCM_VELTS(obj
);
127 while (i
--) h
= ((h
<<8) + (scm_hasher(data
[h
% len
], n
, 2))) % n
;
133 unsigned long h
= (n
)-1;
134 while (i
--) h
= ((h
<<8) + (scm_hasher(data
[i
], n
, d
/len
))) % n
;
138 case scm_tcs_cons_imcar
:
139 case scm_tcs_cons_nimcar
:
140 if (d
) return (scm_hasher(SCM_CAR(obj
), n
, d
/2)+scm_hasher(SCM_CDR(obj
), n
, d
/2)) % n
;
143 return ((SCM_RDNG
& SCM_CARW(obj
)) ? 260 : 261) % n
;
144 case scm_tcs_closures
:
157 scm_ihashq (SCM obj
, unsigned int n
)
159 return (((unsigned int) obj
) >> 1) % n
;
163 SCM_DEFINE (scm_hashq
, "hashq", 2, 0, 0,
165 "Determine a hash value for KEY that is suitable for lookups in\n"
166 "a hashtable of size SIZE, where eq? is used as the equality\n"
167 "predicate. The function returns an integer in the range 0 to\n"
168 "SIZE - 1. NOTE that `hashq' may use internal addresses.\n"
169 "Thus two calls to hashq where the keys are eq? are not\n"
170 "guaranteed to deliver the same value if the key object gets\n"
171 "garbage collected in between. This can happen, for example\n"
172 "with symbols: (hashq 'foo n) (gc) (hashq 'foo n) may produce two\n"
173 "different values, since 'foo will be garbage collected.")
174 #define FUNC_NAME s_scm_hashq
176 SCM_VALIDATE_INUM_MIN (2, size
, 0);
177 return SCM_MAKINUM (scm_ihashq (key
, SCM_INUM (size
)));
186 scm_ihashv (SCM obj
, unsigned int n
)
189 return ((unsigned int)(scm_downcase(SCM_CHAR(obj
)))) % n
; /* downcase!?!! */
192 return (unsigned int) scm_hasher(obj
, n
, 10);
194 return ((unsigned int)obj
) % n
;
198 SCM_DEFINE (scm_hashv
, "hashv", 2, 0, 0,
200 "Determine a hash value for KEY that is suitable for lookups in\n"
201 "a hashtable of size SIZE, where eqv? is used as the equality\n"
202 "predicate. The function returns an integer in the range 0 to\n"
203 "SIZE - 1. NOTE that (hashv key) may use internal addresses.\n"
204 "Thus two calls to hashv where the keys are eqv? are not\n"
205 "guaranteed to deliver the same value if the key object gets\n"
206 "garbage collected in between. This can happen, for example\n"
207 "with symbols: (hashv 'foo n) (gc) (hashv 'foo n) may produce two\n"
208 "different values, since 'foo will be garbage collected.")
209 #define FUNC_NAME s_scm_hashv
211 SCM_VALIDATE_INUM_MIN (2, size
, 0);
212 return SCM_MAKINUM (scm_ihashv (key
, SCM_INUM (size
)));
221 scm_ihash (SCM obj
, unsigned int n
)
223 return (unsigned int)scm_hasher (obj
, n
, 10);
226 SCM_DEFINE (scm_hash
, "hash", 2, 0, 0,
228 "Determine a hash value for KEY that is suitable for lookups in\n"
229 "a hashtable of size SIZE, where equal? is used as the equality\n"
230 "predicate. The function returns an integer in the range 0 to\n"
232 #define FUNC_NAME s_scm_hash
234 SCM_VALIDATE_INUM_MIN (2, size
, 0);
235 return SCM_MAKINUM (scm_ihash (key
, SCM_INUM (size
)));