1 /* Copyright (C) 1995,1996,1997, 2000, 2001 Free Software Foundation, Inc.
3 * This library is free software; you can redistribute it and/or
4 * modify it under the terms of the GNU Lesser General Public
5 * License as published by the Free Software Foundation; either
6 * version 2.1 of the License, or (at your option) any later version.
8 * This library 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 GNU
11 * Lesser General Public License for more details.
13 * You should have received a copy of the GNU Lesser General Public
14 * License along with this library; if not, write to the Free Software
15 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 #include "libguile/_scm.h"
22 #include "libguile/chars.h"
23 #include "libguile/ports.h"
24 #include "libguile/strings.h"
25 #include "libguile/symbols.h"
26 #include "libguile/vectors.h"
28 #include "libguile/validate.h"
29 #include "libguile/hash.h"
33 extern double floor();
38 scm_string_hash (const unsigned char *str
, size_t len
)
43 unsigned long h
= 264;
45 h
= (h
<< 8) + (unsigned) str
[h
% len
];
53 h
= (h
<< 8) + (unsigned) str
[--i
];
59 /* Dirk:FIXME:: why downcase for characters? (2x: scm_hasher, scm_ihashv) */
60 /* Dirk:FIXME:: scm_hasher could be made static. */
64 scm_hasher(SCM obj
, unsigned long n
, size_t d
)
66 switch (SCM_ITAG3 (obj
)) {
69 return SCM_INUM(obj
) % n
; /* SCM_INUMP(obj) */
72 return (unsigned)(scm_downcase(SCM_CHAR(obj
))) % n
;
73 switch (SCM_UNPACK (obj
)) {
75 case SCM_UNPACK(SCM_EOL
):
79 case SCM_UNPACK(SCM_BOOL_T
):
82 case SCM_UNPACK(SCM_BOOL_F
):
85 case SCM_UNPACK(SCM_EOF_VAL
):
89 d
= 263; /* perhaps should be error */
93 return 263 % n
; /* perhaps should be error */
95 switch SCM_TYP7(obj
) {
99 switch SCM_TYP16 (obj
) {
101 return SCM_INUM (scm_modulo (obj
, SCM_MAKINUM (n
)));
106 double r
= SCM_REAL_VALUE (obj
);
107 if (floor (r
) == r
) {
108 obj
= scm_inexact_to_exact (obj
);
109 if SCM_IMP (obj
) return SCM_INUM (obj
) % n
;
110 return SCM_INUM (scm_modulo (obj
, SCM_MAKINUM (n
)));
113 case scm_tc16_complex
:
114 obj
= scm_number_to_string (obj
, SCM_MAKINUM (10));
117 return scm_string_hash (SCM_STRING_UCHARS (obj
), SCM_STRING_LENGTH (obj
)) % n
;
119 return SCM_SYMBOL_HASH (obj
) % n
;
123 size_t len
= SCM_VECTOR_LENGTH(obj
);
124 SCM
const *data
= SCM_VELTS(obj
);
129 while (i
--) h
= ((h
<< 8) + (scm_hasher (data
[h
% len
], n
, 2))) % n
;
135 unsigned long h
= (n
)-1;
136 while (i
--) h
= ((h
<< 8) + (scm_hasher (data
[i
], n
, d
/len
))) % n
;
140 case scm_tcs_cons_imcar
:
141 case scm_tcs_cons_nimcar
:
142 if (d
) return (scm_hasher (SCM_CAR (obj
), n
, d
/2)
143 + scm_hasher (SCM_CDR (obj
), n
, d
/2)) % n
;
146 return ((SCM_RDNG
& SCM_CELL_WORD_0 (obj
)) ? 260 : 261) % n
;
147 case scm_tcs_closures
:
159 scm_ihashq (SCM obj
, unsigned long n
)
161 return (SCM_UNPACK (obj
) >> 1) % n
;
165 SCM_DEFINE (scm_hashq
, "hashq", 2, 0, 0,
167 "Determine a hash value for @var{key} that is suitable for\n"
168 "lookups in a hashtable of size @var{size}, where @code{eq?} is\n"
169 "used as the equality predicate. The function returns an\n"
170 "integer in the range 0 to @var{size} - 1. Note that\n"
171 "@code{hashq} may use internal addresses. Thus two calls to\n"
172 "hashq where the keys are @code{eq?} are not guaranteed to\n"
173 "deliver the same value if the key object gets garbage collected\n"
174 "in between. This can happen, for example with symbols:\n"
175 "@code{(hashq 'foo n) (gc) (hashq 'foo n)} may produce two\n"
176 "different values, since @code{foo} will be garbage collected.")
177 #define FUNC_NAME s_scm_hashq
179 SCM_VALIDATE_INUM_MIN (2, size
, 0);
180 return SCM_MAKINUM (scm_ihashq (key
, SCM_INUM (size
)));
189 scm_ihashv (SCM obj
, unsigned long n
)
192 return ((unsigned long) (scm_downcase (SCM_CHAR (obj
)))) % n
; /* downcase!?!! */
195 return (unsigned long) scm_hasher(obj
, n
, 10);
197 return SCM_UNPACK (obj
) % n
;
201 SCM_DEFINE (scm_hashv
, "hashv", 2, 0, 0,
203 "Determine a hash value for @var{key} that is suitable for\n"
204 "lookups in a hashtable of size @var{size}, where @code{eqv?} is\n"
205 "used as the equality predicate. The function returns an\n"
206 "integer in the range 0 to @var{size} - 1. Note that\n"
207 "@code{(hashv key)} may use internal addresses. Thus two calls\n"
208 "to hashv where the keys are @code{eqv?} are not guaranteed to\n"
209 "deliver the same value if the key object gets garbage collected\n"
210 "in between. This can happen, for example with symbols:\n"
211 "@code{(hashv 'foo n) (gc) (hashv 'foo n)} may produce two\n"
212 "different values, since @code{foo} will be garbage collected.")
213 #define FUNC_NAME s_scm_hashv
215 SCM_VALIDATE_INUM_MIN (2, size
, 0);
216 return SCM_MAKINUM (scm_ihashv (key
, SCM_INUM (size
)));
225 scm_ihash (SCM obj
, unsigned long n
)
227 return (unsigned long) scm_hasher (obj
, n
, 10);
230 SCM_DEFINE (scm_hash
, "hash", 2, 0, 0,
232 "Determine a hash value for @var{key} that is suitable for\n"
233 "lookups in a hashtable of size @var{size}, where @code{equal?}\n"
234 "is used as the equality predicate. The function returns an\n"
235 "integer in the range 0 to @var{size} - 1.")
236 #define FUNC_NAME s_scm_hash
238 SCM_VALIDATE_INUM_MIN (2, size
, 0);
239 return SCM_MAKINUM (scm_ihash (key
, SCM_INUM (size
)));
250 #include "libguile/hash.x"