comparison src/lisp.h @ 2516:b87570db038f

[xemacs-hg @ 2005-01-26 10:25:03 by ben] Rest of hash-table cleanup (Part 2 of 2) lisp.h: Clean up and generalize creation of string hash tables. Use Hashcode rather than unsigned long.
author ben
date Wed, 26 Jan 2005 10:25:05 +0000
parents 3d8143fc88e1
children 902d5bd9b75c
comparison
equal deleted inserted replaced
2515:de9952d2ed18 2516:b87570db038f
3125 #define HASH7(a,b,c,d,e,f,g) (GOOD_HASH * HASH6 (a,b,c,d,e,f) + (g)) 3125 #define HASH7(a,b,c,d,e,f,g) (GOOD_HASH * HASH6 (a,b,c,d,e,f) + (g))
3126 #define HASH8(a,b,c,d,e,f,g,h) (GOOD_HASH * HASH7 (a,b,c,d,e,f,g) + (h)) 3126 #define HASH8(a,b,c,d,e,f,g,h) (GOOD_HASH * HASH7 (a,b,c,d,e,f,g) + (h))
3127 #define HASH9(a,b,c,d,e,f,g,h,i) (GOOD_HASH * HASH8 (a,b,c,d,e,f,g,h) + (i)) 3127 #define HASH9(a,b,c,d,e,f,g,h,i) (GOOD_HASH * HASH8 (a,b,c,d,e,f,g,h) + (i))
3128 3128
3129 #define LISP_HASH(obj) ((unsigned long) LISP_TO_VOID (obj)) 3129 #define LISP_HASH(obj) ((unsigned long) LISP_TO_VOID (obj))
3130 unsigned long string_hash (const char *xv); 3130 Hashcode memory_hash (const void *xv, Bytecount size);
3131 unsigned long memory_hash (const void *xv, Bytecount size); 3131 Hashcode internal_hash (Lisp_Object obj, int depth);
3132 unsigned long internal_hash (Lisp_Object obj, int depth); 3132 Hashcode internal_array_hash (Lisp_Object *arr, int size, int depth);
3133 unsigned long internal_array_hash (Lisp_Object *arr, int size, int depth);
3134 3133
3135 3134
3136 /************************************************************************/ 3135 /************************************************************************/
3137 /* String translation */ 3136 /* String translation */
3138 /************************************************************************/ 3137 /************************************************************************/