--- parser3/src/include/pa_array.h	2001/01/27 15:21:05	1.2
+++ parser3/src/include/pa_array.h	2003/01/23 15:38:05	1.57.2.3
@@ -1,107 +1,176 @@
-/*
-  $Id: pa_array.h,v 1.2 2001/01/27 15:21:05 paf Exp $
-*/
-
-/*
-
-	Array               Chunk0
-	======              ========
-	head--------------->[ptr]
-	append_here-------->[ptr]
-	link_row            ........
-			.			.
-			.			[ptr]
-			...........>[link to the next chunk]
+/** @file
+	Parser: Array & Array_iterator classes decls.
 
+	Copyright (c) 2001, 2003 ArtLebedev Group (http://www.artlebedev.com)
+	Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
 */
 
 #ifndef PA_ARRAY_H
 #define PA_ARRAY_H
 
-#include <stddef.h>
+static const char* IDENT_ARRAY_Y="$Date: 2003/01/23 15:38:05 $";
 
-#include "pa_types.h"
+#include "pa_pool.h"
+//#include "pa_types.h"
+#include "pa_exception.h"
 
-class Pool;
+template<typename T> class Array_iterator;
+
+/**	
+	Simple Array.
+
+*/
+template<typename T> class Array: public PA_Object {
+
+	friend class Array_iterator;
+
+	// allocated size
+	int fallocated;
 
-class Array {
 public:
-	typedef void *Item;
+	typedef T element_type;
 
-	enum {
-		CR_PREALLOCATED_COUNT=10,
-		CR_GROW_PERCENT=60
-	};
-
-private:
-	friend Pool;
-
-	// the pool I'm allocated on
-	Pool *pool;
-
-	struct Chunk {
-		// the number of rows in chunk
-		int count;
-		union Row {
-			Item item;
-			Chunk *link;  // link to the next chunk in chain
-		} rows[1];
-		// next rows are here
-	}
-		*head;  // the head chunk of the chunk chain
-
-	// next append would write to this record
-	Chunk::Row *append_here;
-	
-	// the address of place where lies address 
-	// of the link to the next chunk to allocate
-	Chunk::Row *link_row;
-
-private:
-	// last chank allocated count
-	int curr_chunk_rows;
+	Array(int initial=3, int delta=1):
+		fallocated(initial?initial:3),
+		fdelta(delta),
+		fused(0)
+	{
+		if(fallocated<=0 || fdelta<1)
+			throw Exception(0, 0,
+				"Array::Array(%d, %d) too small", initial, delta);
 
-	// array size
-	int fused_rows;
+		felements=new T[fallocated];
+	}
+	override ~Array() {
+		T *last=felements+fused;
+		for(T *current=felements; current<last; current++)
+			delete current;
 
-	int cache_index;
-	Chunk::Row *cache_row;
-	int cache_countdown;
-	Chunk::Row *cache_link_row;
-	
-private:
-	// new&constructors made private to enforce factory manufacturing at pool
-	void *operator new(size_t size, Pool *apool);
+		delete felements;
+	}
 
-	void construct(Pool *apool, int initial_rows);
-	Array(Pool *apool) {
-		construct(apool, CR_PREALLOCATED_COUNT); 
+	/// how many items are in Array
+	int count() const { return fused; }
+	/// append to array
+	Array& operator += (T src) {
+		if(is_full())
+			expand(fdelta);
+
+		felements[fused++]=src;
+
+		return *this;
 	}
-	Array(Pool *apool, int initial_rows) {
-		construct(apool, initial_rows); 
+
+	/// 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())) {
+			throw Exception(0, 0,
+				"Array::append(offset=%d) out of range [0..%d]", offset, src.count()-1);
+			//return 0; // never
+		}
+		// fix limit
+		{
+			int m=src.count()-offset;
+			if(!m || limit<0)
+				return *this;
+			if(!limit || limit>m)
+				limit=m;
+		}
+
+		int needed=limit-(fallocated-fused);
+		if(needed>0)
+			expand(needed);
+
+		memcpy(&felements[fused+=limit], &src.felements[offset], limit*sizeof(T));
 	}
 
+	/// get index-element
+	T get(int index) const {
+		if(!(index>=0 && index<size())) {
+			throw Exception(0, 0,
+				"Array::get(%d) out of range [0..%d]", index, count()-1);
+			return 0; // never
+		}
 
-	bool chunk_is_full() {
-		return append_here == link_row;
+		return felements[index];
+	}
+
+	/// put index-element
+	void put(int index, T element) {
+		if(!(index>=0 && index<size())) {
+			throw Exception(0, 0, 
+				"Array::put(%d) out of range [0..%d]", index, size()-1);
+			return; // never
+		}
+		felements[index]=element;
 	}
-	void expand();
 
-public:
 
-	int size() { return fused_rows; }
-	Array& operator += (Item src);
+	/// iterate over all elements
+	template<typename I> void for_each(void callback(T, I), I info) const {
+		T *last=felements+fused;
+		for(T *current=felements; current<last; current++)
+			callback(*current, info);
+	}
 
-	/*
-	void put(int index, Item item);
-	Item get(int index);
-	*/
-	Item& operator [] (int index);
+	/// iterate over all elements until condition becomes true, return that element
+	template<typename I> T *first_that(bool callback(T, I), I info) const {
+		T *last=felements+fused;
+		for(T *current=felements; current<last; current++)
+			if(callback(*current, info))
+				return *current;
+
+		return 0;
+	}
+
+protected:
+
+	// default expand delta size
+	int fdelta;
+
+	/// elements[growing size] here
+	T *felements;
+
+	// array size
+	int fused;
+
+	bool is_full() {
+		return fused == fallocated;
+	}
+	void expand(int delta) {
+		fallocated+=delta;
+		felements = (T *)pa_realloc(felements, fallocated*sizeof(T));
+	}
 
 private: //disabled
 
-	Array& operator = (Array& src) { return *this; }
-	Array(Array& src) {}
+	Array& operator = (const Array&) { return *this; }
+};
+
+/// handy array iterator
+template<typename T> class Array_iterator {
+
+	const Array<T>& farray;
+	T *fcurrent;
+	T *flast;
+
+public:
+
+	Array_iterator(const Array<T>& aarray) : farray(aarray) {
+		fcurrent(farray.felements);
+		flast=farray+farray.count();
+	}
+
+	/// there are still elements
+	bool has_next() {
+		return fcurrent<flast;
+	}
+
+	/// quickly extracts next Array element
+	T next() {
+		return *(furrent++);
+	}
+
 };
 
 #endif