mirror of
https://github.com/gigablast/open-source-search-engine.git
synced 2024-10-04 20:27:43 +03:00
116 lines
2.9 KiB
C++
116 lines
2.9 KiB
C++
// . generic hash table class
|
|
|
|
#ifndef _HASHTABLET_H_
|
|
#define _HASHTABLET_H_
|
|
|
|
#include "Mem.h" // for mcalloc and mmalloc
|
|
#include "SafeBuf.h"
|
|
#include "types.h"
|
|
using namespace std;
|
|
|
|
#define HT_BUF_SIZE (4*1024)
|
|
|
|
template<class Key_t, class Val_t>
|
|
class HashTableT {
|
|
|
|
public:
|
|
|
|
bool set ( int32_t initialNumSlots = 0 ,
|
|
char *buf = NULL ,
|
|
int32_t bufSize = 0 ,
|
|
bool allowDupKeys = false );
|
|
|
|
HashTableT( ) ;
|
|
~HashTableT( );
|
|
|
|
void constructor();
|
|
|
|
// . add key/value entry to hash table
|
|
// . will grow hash table if it needs to
|
|
bool addKey ( Key_t key , Val_t value , int32_t *slot = NULL );
|
|
|
|
// remove key/value entry to hash table
|
|
bool removeKey ( Key_t key );
|
|
|
|
void removeSlot ( int32_t n );
|
|
|
|
bool load ( char *filename , char **textBuf = NULL , int32_t *textBufSize = NULL );
|
|
bool save ( char *filename , char *textBuf = NULL , int32_t textBufSize = 0 );
|
|
|
|
// . used by ../english/Bits.h to store stop words, abbr's, ...
|
|
// . returns the score for this termId (0 means empty usually)
|
|
Val_t* getValuePointer ( Key_t key ) const;
|
|
|
|
Val_t* getValuePtr ( Key_t key ) { return getValuePointer ( key ); };
|
|
|
|
// value of 0 means empty
|
|
//bool isEmpty ( Key_t key ) { return (getValue(key) == 0); };
|
|
|
|
Key_t getKey ( int32_t n ) const { return m_keys[n]; };
|
|
|
|
int32_t getSlot ( Key_t key ) const { return getOccupiedSlotNum ( key ); };
|
|
// for hash tables that m_allowDupKeys
|
|
int32_t getNextSlot ( Key_t& key , int32_t n ) const ;
|
|
|
|
void setValue ( int32_t n , Val_t val ) { m_vals[n] = val; };
|
|
|
|
bool isEmpty ( int32_t n ) { return ( m_keys[n] == 0 ); };
|
|
|
|
Val_t getValueFromSlot ( int32_t n ) const { return m_vals[n]; };
|
|
|
|
Val_t* getValuePointerFromSlot ( int32_t n ) { return &m_vals[n]; };
|
|
|
|
// frees the used memory, etc.
|
|
void reset ( );
|
|
|
|
bool copy(HashTableT<Key_t, Val_t>* retval);
|
|
|
|
// removes all key/value pairs from hash table, vacates all slots
|
|
void clear ( );
|
|
|
|
// how many are occupied?
|
|
int32_t getNumSlotsUsed ( ) const { return m_numSlotsUsed; };
|
|
|
|
// how many are there total? used and unused.
|
|
int32_t getNumSlots ( ) const { return m_numSlots; };
|
|
|
|
void setAllowDupKeys(char allow) { m_allowDupKeys = allow; };
|
|
char getAllowDupKeys( ) const { return m_allowDupKeys; };
|
|
|
|
bool serialize(SafeBuf& sb);
|
|
int32_t deserialize(char* s);
|
|
|
|
bool setTableSize ( int32_t numSlots, char *buf, int32_t bufSize );
|
|
|
|
int32_t getOccupiedSlotNum ( Key_t& key ) const;
|
|
|
|
//private:
|
|
//friend class RequestTable;
|
|
// . the array of buckets in which we store the terms
|
|
// . scores are allowed to exceed 8 bits for weighting purposes
|
|
Key_t *m_keys;
|
|
Val_t *m_vals;
|
|
|
|
int32_t m_numSlots;
|
|
int32_t m_numSlotsUsed;
|
|
|
|
char m_allowDupKeys;
|
|
|
|
char m_doFree;
|
|
|
|
char *m_buf; //. hash table buffer points to callers buffer on stack
|
|
int32_t m_bufSize;
|
|
|
|
// char m_buf1 [ HT_BUF_SIZE ];
|
|
// char m_buf2 [ HT_BUF_SIZE ];
|
|
};
|
|
|
|
bool hashFromString ( HashTableT<int64_t,char> *ht , char *x ) ;
|
|
|
|
#endif
|
|
|
|
|
|
|
|
|
|
|