upscheme/llt/hashing.h

#ifndef __HASHING_H_
#define __HASHING_H_

uint_t nextipow2(uint_t i);
u_int32_t int32hash(u_int32_t a);
u_int64_t int64hash(u_int64_t key);
u_int32_t int64to32hash(u_int64_t key);
#ifdef BITS64
#define inthash int64hash
#else
#define inthash int32hash
#endif
u_int64_t memhash(char* buf, size_t n);
u_int32_t memhash32(char* buf, size_t n);

#endif
import of llt library source 2008-06-30 21:53:51 -04:00			`#ifndef __HASHING_H_`
			`#define __HASHING_H_`

			`uint_t nextipow2(uint_t i);`
			`u_int32_t int32hash(u_int32_t a);`
			`u_int64_t int64hash(u_int64_t key);`
			`u_int32_t int64to32hash(u_int64_t key);`
			`#ifdef BITS64`
			`#define inthash int64hash`
			`#else`
			`#define inthash int32hash`
			`#endif`
			`u_int64_t memhash(char* buf, size_t n);`
support reading hex float literals better text representation of infs and nans removing construction of low-level numeric types directly from strings adding hash function corresponding to equal better way to initialize builtins moving advanced bitvector ops to separate compilation unit rearranging hash table code so it can be specialized for different comparison functions one good way to bloat a piece of software is to add several ASCII pictures of the mona lisa 2008-11-23 02:12:37 -05:00			`u_int32_t memhash32(char* buf, size_t n);`
import of llt library source 2008-06-30 21:53:51 -04:00
			`#endif`