---

epHash.h

Go to the documentation of this file.

#ifndef _EPHASH_H_
#define _EPHASH_H_

#include "epDefs.h"

struct epHashElt_s {
  void *key,                
       *value;              
  struct epHashElt_s *next; 
};

typedef struct epHash_s {
  struct epHashElt_s **bucketArray; 
  long numOfBuckets,                
       numOfElements;               
  double lowerRehashThreshold,    
         upperRehashThreshold,    
         idealRatio;              
  boolean_t (*keyComparisonFunction)(const void *key1, const void *key2);
  //boolean (*valueCompare)(const void *value1, const void *value2);

  /* hashkey function                                                        */
  uint (*hashFunction)(const void *key);
  /* key deallocator function                                                */
  int  (*keyDeallocatorFunction)(void *key);
  /* value deallocator function                                              */
  int  (*valueDeallocatorFunction)(void *value);
} epHash_t;


#define HAS_TO_BE_REHASHED(hTable)                                 \
         ((  (hTable)->upperRehashThreshold > 0.0 &&               \
           (((hTable)->numOfElements / (hTable)->numOfBuckets) >   \
             (hTable)->upperRehashThreshold))                      \
              ||                                                   \
          (  (hTable)->lowerRehashThreshold > 0.0 &&               \
           (((hTable)->numOfElements / (hTable)->numOfBuckets) <   \
             (hTable)->lowerRehashThreshold)))                     


/* par défaut, par de rehash automatique décrémentiel */
#define _DEFAULT_LowerRehashThreshold  0.0
#define _DEFAULT_UpperRehashThreshold  15.0
#define _DEFAULT_IdealRatio            3.0


epHash_t *epHash_create(const ulong numOfBuckets,
  boolean_t (*keyComparisonFunction)(const void *key1, const void *key2),
  uint    (*hashFunction)(const void *key),
  int     (*keyDeallocatorFunction)(void *key),
  int     (*valueDeallocatorFunction)(void *value));

int epHash_destroy(epHash_t *hashTable);
uint epHash_size(epHash_t *hashTable);
boolean_t epHash_isEmpty(epHash_t *hashTable);
uint epHash_getNumOfBuckets(epHash_t *hashTable);
int epHash_put(epHash_t *hashTable, const void *key, const void *value);
void *epHash_get(const epHash_t *hashTable, const void *key);
int epHash_remove(epHash_t *hashTable, const void *key);
boolean_t epHash_containsKey(epHash_t *hashTable, const void *key);
int epHash_rehash(epHash_t *hashTable, uint numOfBuckets);
void epHash_setIdealRatio(epHash_t *hashTable, double idealRatio,
                          double lowerRehashThreshold, 
                          double upperRehashThreshold);
uint calculateIdealNumOfBuckets(const epHash_t *hashTable);

#endif /* _EPHASH_H_ */

---