--- parser3/src/include/pa_hash.h	2001/01/27 12:04:53	1.2
+++ parser3/src/include/pa_hash.h	2001/03/18 11:37:50	1.25
@@ -1,10 +1,9 @@
 /*
-  $Id: pa_hash.h,v 1.2 2001/01/27 12:04:53 paf Exp $
-*/
-
-/*
-
+	Parser
+	Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
+	Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
 
+	$Id: pa_hash.h,v 1.25 2001/03/18 11:37:50 paf Exp $
 */
 
 #ifndef PA_HASH_H
@@ -12,37 +11,75 @@
 
 #include <stddef.h>
 
+#include "pa_pool.h"
 #include "pa_types.h"
 #include "pa_string.h"
 
-class Pool;
+class Hash : public Pooled {
+public:
+
+	typedef String Key;
+	typedef void Value;
 
-typedef String Key;
-typedef void Value;
+	typedef void (*Foreach_func)(void *info, const Key& key, Value *value);
 
-class Hash {
 public:
 
+	Hash(Pool& apool,bool athread_safe=false) : Pooled(apool) { 
+		construct(apool, athread_safe); 
+	}
+
+	// useful generic hash function
+	static uint generic_code(uint aresult, const char *start, uint allocated);
+
+	// 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 *>(value)); }
+	void put(const Key& key, String *value) { put(key, static_cast<Value *>(value)); }
+
+	int get_int(const Key& key) { return reinterpret_cast<int>(get(key)); }
+	const String *get_string(const Key& key) { return static_cast<String *>(get(key)); }
+
+	int size() { return used; }
+
+	void foreach(Foreach_func func, void *info);
+
+protected:
+
+	void construct(Pool& apool, bool athread_safe);
+
 private:
-	friend Pool;
 
-	// expand when there would be used this %% of size
+	// expand when these %% of allocated 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
-	int size_index;
+	// the index of [allocated] in [allocates]
+	int allocates_index;
 
-	// possible sizes. prime numbers
-	static uint sizes[];
-	static int sizes_count;
+	// possible [allocates]. prime numbers
+	static uint allocates[];
+	static int allocates_count;
 
 	// number of allocated pairs
-	int size;
+	int allocated;
 
 	// helper: expanding when used == threshold
 	int threshold;
@@ -55,34 +92,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 allocated, 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