--- parser3/src/include/pa_hash.h 2001/01/27 12:04:53 1.2 +++ parser3/src/include/pa_hash.h 2001/02/25 13:23:00 1.18 @@ -1,5 +1,5 @@ /* - $Id: pa_hash.h,v 1.2 2001/01/27 12:04:53 paf Exp $ + $Id: pa_hash.h,v 1.18 2001/02/25 13:23:00 paf Exp $ */ /* @@ -12,32 +12,63 @@ #include +#include "pa_pool.h" #include "pa_types.h" #include "pa_string.h" -class Pool; +class Hash : virtual public Pooled { +public: -typedef String Key; -typedef void Value; + typedef String Key; + typedef void Value; -class Hash { public: + Hash(Pool& apool,bool) : Pooled(apool) { construct(apool, true); } + Hash(Pool& apool) : Pooled(apool) { construct(apool, false); } + + // useful generic hash function + static uint generic_code(uint aresult, const char *start, uint size); + + // put a [value] under the [key], return existed or not + /*SYNCHRONIZED*/ bool put(const Key& key, Value *value); + + // get associated [value] by the [key] + /*SYNCHRONIZED*/ Value *get(const Key& key) const; + + // put a [value] under the [key] if that [key] existed, return existed or not + /*SYNCHRONIZED*/ bool put_replace(const Key& key, Value *value); + + // put a [value] under the [key] if that [key] NOT existed, return existed or not + /*SYNCHRONIZED*/ bool put_dont_replace(const Key& key, Value *value); + + // put all 'src' values if NO with same key existed + /*SYNCHRONIZED*/ void merge_dont_replace(const Hash& src); + + void put(const Key& key, int value) { put(key, reinterpret_cast(value)); } + void put(const Key& key, String *value) { put(key, static_cast(value)); } + + int get_int(const Key& key) { return reinterpret_cast(get(key)); } + String *get_string(const Key& key) { return static_cast(get(key)); } + +protected: + + void construct(Pool& apool, bool athread_safe); + private: - friend Pool; - // expand when there would be used this %% of size + // expand when these %% of size exausted enum { THRESHOLD_PERCENT=75 }; - // the pool I'm allocated on - Pool *pool; + // am I thread-safe? + bool thread_safe; - // the index of size in sizes + // the index of [size] in [sizes] int size_index; - // possible sizes. prime numbers + // possible [sizes]. prime numbers static uint sizes[]; static int sizes_count; @@ -55,34 +86,29 @@ private: friend Hash; uint code; - Key key; + const Key key; Value *value; Pair *link; - void *operator new(size_t size, Pool *apool); + void *operator new(size_t size, Pool& apool); - Pair(uint acode, Key& akey, Value *avalue, Pair *alink) : + Pair(uint acode, const Key& akey, Value *avalue, Pair *alink) : code(acode), key(akey), value(avalue), link(alink) {} } **refs; - // new&constructors made private to enforce factory manufacturing at pool - void *operator new(size_t size, Pool *apool); - - Hash(Pool *apool); + // filled to threshold: needs expanding + bool full() { return used==threshold; } - bool full() { - return used==threshold; - } + // allocate larger buffer & rehash void expand(); -public: +private: //disabled - static uint generic_code(uint aresult, char *start, uint size); - void put(Key& key, Value *value); - Value* get(Key& key); + //Hash(Hash&) {} + Hash& operator = (const Hash&) { return *this; } }; #endif