2006-08-03 21:27:16 +03:00
|
|
|
#ifndef __CMPH_FCH_H__
|
|
|
|
#define __CMPH_FCH_H__
|
|
|
|
|
|
|
|
#include "cmph.h"
|
|
|
|
|
|
|
|
typedef struct __fch_data_t fch_data_t;
|
|
|
|
typedef struct __fch_config_data_t fch_config_data_t;
|
|
|
|
|
2006-08-07 17:44:24 +03:00
|
|
|
/* Parameters calculation */
|
2008-04-12 09:17:21 +03:00
|
|
|
cmph_uint32 fch_calc_b(double c, cmph_uint32 m);
|
|
|
|
double fch_calc_p1(cmph_uint32 m);
|
|
|
|
double fch_calc_p2(cmph_uint32 b);
|
|
|
|
cmph_uint32 mixh10h11h12(cmph_uint32 b, double p1, double p2, cmph_uint32 initial_index);
|
2006-08-07 17:44:24 +03:00
|
|
|
|
2006-08-03 21:27:16 +03:00
|
|
|
fch_config_data_t *fch_config_new();
|
|
|
|
void fch_config_set_hashfuncs(cmph_config_t *mph, CMPH_HASH *hashfuncs);
|
|
|
|
void fch_config_destroy(cmph_config_t *mph);
|
2008-04-12 09:17:21 +03:00
|
|
|
cmph_t *fch_new(cmph_config_t *mph, double c);
|
2006-08-03 21:27:16 +03:00
|
|
|
|
|
|
|
void fch_load(FILE *f, cmph_t *mphf);
|
|
|
|
int fch_dump(cmph_t *mphf, FILE *f);
|
|
|
|
void fch_destroy(cmph_t *mphf);
|
|
|
|
cmph_uint32 fch_search(cmph_t *mphf, const char *key, cmph_uint32 keylen);
|
2008-03-26 22:26:48 +02:00
|
|
|
|
|
|
|
/** cmph_uint32 fch_search_fingerprint(cmph_t *mphf, const char *key, cmph_uint32 keylen, cmph_uint32 * fingerprint);
|
|
|
|
* \brief Computes the mphf value and a fingerprint of 12 bytes (i.e., figerprint should be a prealocated area to fit three 4-byte integers).
|
|
|
|
* \param mphf pointer to the resulting function
|
|
|
|
* \param key is the key to be hashed
|
|
|
|
* \param keylen is the key legth in bytes
|
|
|
|
* \return The mphf value
|
|
|
|
*
|
|
|
|
* Computes the mphf value and a fingerprint of 12 bytes. The figerprint pointer should be
|
|
|
|
* a prealocated area to fit three 4-byte integers. You don't need to use all the 12 bytes
|
|
|
|
* as fingerprint. According to the application, just few bits can be enough, once mphf does
|
|
|
|
* not allow collisions for the keys previously known.
|
|
|
|
*/
|
|
|
|
cmph_uint32 fch_search_fingerprint(cmph_t *mphf, const char *key, cmph_uint32 keylen, cmph_uint32 * fingerprint);
|
|
|
|
|
|
|
|
/** \fn void fch_pack(cmph_t *mphf, void *packed_mphf);
|
|
|
|
* \brief Support the ability to pack a perfect hash function into a preallocated contiguous memory space pointed by packed_mphf.
|
|
|
|
* \param mphf pointer to the resulting mphf
|
|
|
|
* \param packed_mphf pointer to the contiguous memory area used to store the resulting mphf. The size of packed_mphf must be at least cmph_packed_size()
|
|
|
|
*/
|
|
|
|
void fch_pack(cmph_t *mphf, void *packed_mphf);
|
|
|
|
|
|
|
|
/** \fn cmph_uint32 fch_packed_size(cmph_t *mphf);
|
|
|
|
* \brief Return the amount of space needed to pack mphf.
|
|
|
|
* \param mphf pointer to a mphf
|
|
|
|
* \return the size of the packed function or zero for failures
|
|
|
|
*/
|
|
|
|
cmph_uint32 fch_packed_size(cmph_t *mphf);
|
|
|
|
|
|
|
|
/** cmph_uint32 fch_search(void *packed_mphf, const char *key, cmph_uint32 keylen);
|
|
|
|
* \brief Use the packed mphf to do a search.
|
|
|
|
* \param packed_mphf pointer to the packed mphf
|
|
|
|
* \param key key to be hashed
|
|
|
|
* \param keylen key legth in bytes
|
|
|
|
* \return The mphf value
|
|
|
|
*/
|
|
|
|
cmph_uint32 fch_search_packed(void *packed_mphf, const char *key, cmph_uint32 keylen);
|
|
|
|
|
2006-08-03 21:27:16 +03:00
|
|
|
#endif
|