--- parser3/src/include/pa_array.h	2003/02/03 14:40:07	1.57.2.18
+++ parser3/src/include/pa_array.h	2003/03/19 13:16:56	1.57.2.27.2.2
@@ -8,17 +8,18 @@
 #ifndef PA_ARRAY_H
 #define PA_ARRAY_H
 
-static const char* IDENT_ARRAY_Y="$Date: 2003/02/03 14:40:07 $";
+static const char* IDENT_ARRAY_H="$Date: 2003/03/19 13:16:56 $";
 
-#include "pa_pool.h"
+// includes
+
+#include "pa_memory.h"
 #include "pa_exception.h"
 
-template<typename T> class Array_iterator;
+// forwards
 
-/**	
-	Simple Array.
+template<typename T> class Array_iterator;
 
-*/
+/// Simple Array
 template<typename T> class Array: public PA_Object {
 
 	friend class Array_iterator<T>;
@@ -40,24 +41,19 @@ protected:
 public:
 	typedef T element_type;
 
-	Array(int initial=3, int delta=1):
-		fallocated(initial?initial:3),
-		fdelta(delta),
+	Array(int initial=3):
+		fallocated(initial>3?initial:3),
 		fused(0)
 	{
-		if(fallocated<=0 || fdelta<1)
-			throw Exception(0, 
-				Exception::undefined_source,
-				"Array::Array(%d, %d) too small", initial, delta);
-
-		felements=new T[fallocated];
+		felements=static_cast<T*>(malloc(fallocated*sizeof(T)));
 	}
 	override ~Array() {
+		// see comment in ctor
 		T *last=felements+fused;
 		for(T *current=felements; current<last; current++)
-			delete current;
+			current->~T(); // manually invoking destructors
 
-		delete felements;
+		free(felements);
 	}
 
 	/// how many items are in Array
@@ -74,11 +70,11 @@ public:
 
 	/// append other Array portion to this one. starting from offset
 	Array& append(const Array& src, int offset=0, int limit=0) {
-		if(!(offset>=0 && offset<src.count())) {
+		if(offset<0) {
 			throw Exception(0, 
 				Exception::undefined_source,
-				"Array::append(offset=%d) out of range [0..%d]", offset, src.count()-1);
-			//return 0; // never
+				"Array::append(offset=%d) out <0", offset);
+			//return Nothing; // never
 		}
 		// fix limit
 		{
@@ -89,16 +85,22 @@ public:
 				limit=m;
 		}
 
-		int needed=limit-(fallocated-fused);
-		if(needed>0)
-			expand(needed);
-
-		memcpy(&felements[fused+=limit], &src.felements[offset], limit*sizeof(T));
+		int delta=limit-(fallocated-fused);
+		if(delta>0)
+			expand(delta);
+
+		T* from=&src.felements[offset];
+		T* to=&felements[fused];
+		T* from_end=from+limit;
+		while(from<from_end)
+			*to++=*from++;
+		
+		fused+=limit;
 		return *this;
 	}
 
 	/// get index-element
-	T& get(int index) {
+	T& get(int index) const {
 		if(!(index>=0 && index<count())) {
 			throw Exception(0, 
 				Exception::undefined_source,
@@ -109,7 +111,7 @@ public:
 		return felements[index];
 	}
 
-	T& operator [](int index) { return get(index); }
+	T& operator [](int index) const { return get(index); }
 
 	/// put index-element
 	void put(int index, T& element) {
@@ -137,7 +139,7 @@ public:
 			if(callback(*current, info))
 				return *current;
 
-		return 0;//T(0);
+		return T(0);
 	}
 
 protected:
@@ -146,8 +148,9 @@ protected:
 		return fused == fallocated;
 	}
 	void expand(int delta) {
+		felements = (T *)realloc(felements, (fallocated+delta)*sizeof(T));
+		memset(&felements[fallocated], 0, delta*sizeof(T));
 		fallocated+=delta;
-		felements = (T *)realloc(felements, fallocated*sizeof(T));
 	}
 
 private: //disabled
@@ -155,33 +158,53 @@ private: //disabled
 	Array& operator = (const Array&) { return *this; }
 };
 
-typedef smart_ptr<char> CharPtr;
 
-class Pool: public Array<CharPtr> {
+/** Array iterator, usage:
+	@code
+	// Array<T> a;
+	Array_iterator<T> i(a);
+	while(i.has_next()) {
+		T& element=i.next();
+		...
+	}	
+	@endcode
+*/
+template<typename T> class Array_iterator {
+
+	const Array<T>& farray;
+	T *fcurrent;
+	T *flast;
+
 public:
-	char *malloc(size_t size) {
-		CharPtr result=CharPtr((char *)Array<CharPtr>::malloc(size));
-		*this += result;
-		return result.get();
+
+	Array_iterator(const Array<T>& aarray): farray(aarray) {
+		fcurrent=farray.felements;
+		flast=farray.felements+farray.count();
 	}
 
-	char *copy(const char* buf, size_t size=0) {
-		if(!size)
-			size=strlen(buf)+1;
-
-		char *result=malloc(size);
-		memcpy(result, buf, size);
-		return result;
+	/// there are still elements
+	bool has_next() {
+		return fcurrent<flast;
 	}
-};
 
-#define HERE1
-inline void *operator new(size_t size, Pool& pool) { 
-	return pool.malloc(size);
-}
+	/// quickly extracts next Array element
+	const T& next() {
+		return *(fcurrent++);
+	}
 
-/// handy array iterator
-template<typename T> class Array_iterator {
+};
+
+/** Nonconst array iterator, usage:
+	@code
+	// Array<T> a;
+	Array_iterator<T> i(a);
+	while(i.has_next()) {
+		T& element=i.next();
+		...
+	}	
+	@endcode
+*/
+template<typename T> class Array_modifing_iterator {
 
 	Array<T>& farray;
 	T *fcurrent;
@@ -189,7 +212,7 @@ template<typename T> class Array_iterato
 
 public:
 
-	Array_iterator(Array<T>& aarray): farray(aarray) {
+	Array_modifing_iterator(Array<T>& aarray): farray(aarray) {
 		fcurrent=farray.felements;
 		flast=farray.felements+farray.count();
 	}