--- parser3/src/include/pa_array.h	2001/04/03 05:23:40	1.34
+++ parser3/src/include/pa_array.h	2003/01/23 11:37:55	1.57.2.2
@@ -1,170 +1,171 @@
 /** @file
-	Parser: array class decl.
+	Parser: Array & Array_iterator classes decls.
 
-	Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
-
-	Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
-
-	$Id: pa_array.h,v 1.34 2001/04/03 05:23:40 paf Exp $
+	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 11:37:55 $";
 
 #include "pa_pool.h"
-#include "pa_types.h"
-#include "pa_string.h"
+//#include "pa_types.h"
+
+class Array_iterator;
 
 /**	
-	Pooled Array.
+	Simple Array.
 
-	Internal structure:
-	@verbatim
-		Array               Chunk0
-		======              ========
-		head--------------->[ptr]
-		append_here-------->[ptr]
-		link_row            ........
-				.			.
-				.			[ptr]
-				...........>[link to the next chunk]
-	@endverbatim
 */
+template<typename T> class Array: public PA_Object {
 
-class Array : public Pooled {
-public:
+	friend class Array_iterator;
 
-	/// Array item type
-	typedef void Item;
+	/// elements[growing size] here
+	T *felements;
 
-	/// for_each iterator function type
-	typedef void (*For_each_func)(Item *value, void *info);
+	// array size
+	int fused;
 
-	/// first_that iterator function type, const info
-	typedef bool (*First_that_func_const)(Item *value, const void *info);
+	// allocated size
+	int fallocated;
 
-	/// first_that iterator function type
-	typedef bool (*First_that_func)(Item *value, void *info);
-
-	enum {
-		CR_INITIAL_ROWS_DEFAULT=10, ///< default preallocated row count
-		CR_GROW_PERCENT=60 ///< each time the Array chunk_is_full() array expanded()
-	};
+	// default expand delta size
+	int fdelta;
 
 public:
+	typedef T element_type;
 
-	Array(Pool& apool, int initial_rows=CR_INITIAL_ROWS_DEFAULT);
+	Array(int initial=3, int delta=5):
+		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);
 
-	/**
-		size Array. how many items are in it. 
-		must be used with quick_get like this:
-		@code
-			int size=src.quick_size();
-			for(int i=0; i<size; i++) {
-				z=src.quick_get(i);
-			}
-		@endcode
-	*/
-	int quick_size() const { 
-		// for quick_get
-		cache_chunk_base=0;
-		cache_chunk=head;
-		return size(); 
-	}
-	/// size Array. how many items are in it
-	int size() const { return fused_rows; }
-	/// append Item to array
-	Array& operator += (Item *src);
+		felements=new T[fallocated];
+	}
+	override ~Array() {
+		delete felements;
+	}
 
-	/// dirty hack to allow constant items storage. I long for Array<const Item*>
-	Array& operator += (const Item *src) { return *this+=const_cast<Item*>(src); }
+	/// how many items are in Array
+	int count() const { return fused; }
+	/// append to array
+	Array& operator += (T src) {
+		if(is_full())
+			expand(fdelta);
 
-	/// append other Array portion to this one. starting from offset
-	Array& append_array(const Array& src, int offset=0);
+		felements[fused++]=src;
 
-	/** 
-		quickly gets some item considering...
+		return *this;
+	}
 
-		these true:
-			- index increments from 0 to size()-1
-			- index>=0 && index<size()
-			- index>=cache_chunk_base
-	*/
-	Item *quick_get(int index) const {
-		// next chunk will be with "index" row
-		if(!(index<cache_chunk_base+cache_chunk->count)) {
-			int count=cache_chunk->count;
-			cache_chunk_base+=count;
-			cache_chunk=cache_chunk->rows[count].link;
+	/// 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;
 		}
-		
-		return cache_chunk->rows[index-cache_chunk_base].item;
+
+		int needed=limit-(fallocated-fused);
+		if(needed>0)
+			expand(needed);
+
+		memcpy(&felements[fused+=limit], &src.felements[offset], limit*sizeof(T));
 	}
 
-	Item *get(int index) const;
-	void put(int index, Item *item);
-	/// convinient way to get strings from Array. I long for Array<const String *>
-	const String *get_string(int index) const { 
-		return const_cast<const String *>(static_cast<String *>(get(index))); 
+	/// 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
+		}
+
+		return felements[index];
 	}
-	const String *quick_get_string(int index) const { 
-		return const_cast<const String *>(static_cast<String *>(quick_get(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;
 	}
 
+
 	/// iterate over all elements
-	void for_each(For_each_func func, void *info=0) const;
+	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);
+	}
 
-	/// iterate over all elements until condition, const info
-	void* first_that(First_that_func_const func, const void *info=0) const;
+	/// 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;
 
-	/// iterate over all elements until condition
-	void* first_that(First_that_func func, void *info=0) const;
+		return 0;
+	}
 
 private:
 
-	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
-
-	// last allocated chunk
-	// helps appending Arrays
-	Chunk *tail;
-
-	// 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;
+	bool is_full() {
+		return fused == fallocated;
+	}
+	void expand(int delta) {
+		fallocated+=delta;
+		felements = (T *)pa_realloc(felements, fallocated*sizeof(T));
+	}
 
-private:
+private: //disabled
 
-	// array size
-	int fused_rows;
+	Array& operator = (const Array&) { return *this; }
+};
 
-	mutable int cache_chunk_base;
-	mutable Chunk *cache_chunk;
-	
-private:
+/// handy array iterator
+template<typename T> class Array_iterator {
 
-	bool chunk_is_full() {
-		return append_here == link_row;
+	const Array<T>& farray;
+	T *fcurrent;
+	T *flast;
+
+public:
+
+	Array_iterator(const Array<T>& aarray) : farray(aarray) {
+		fcurrent(farray.felements);
+		flast=farray+farray.count();
 	}
-	void expand(int chunk_rows);
 
-private: //disabled
+	/// there are still elements
+	bool has_next() {
+		return fcurrent<flast;
+	}
+
+	/// quickly extracts next Array element
+	T next() {
+		return *(furrent++);
+	}
 
-	//Array(Array&) { }
-	Array& operator = (const Array&) { return *this; }
 };
 
 #endif