--- parser3/src/include/pa_array.h	2001/01/29 15:56:03	1.7
+++ parser3/src/include/pa_array.h	2003/01/31 12:34:29	1.57.2.16
@@ -1,97 +1,208 @@
-/*
-  $Id: pa_array.h,v 1.7 2001/01/29 15:56:03 paf Exp $
+/** @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
+
+static const char* IDENT_ARRAY_Y="$Date: 2003/01/31 12:34:29 $";
+
+#include "pa_pool.h"
+#include "pa_exception.h"
+
+template<typename T> class Array_iterator;
 
-	Array               Chunk0
-	======              ========
-	head--------------->[ptr]
-	append_here-------->[ptr]
-	link_row            ........
-			.			.
-			.			[ptr]
-			...........>[link to the next chunk]
+/**	
+	Simple Array.
 
 */
+template<typename T> class Array: public PA_Object {
 
-#ifndef PA_ARRAY_H
-#define PA_ARRAY_H
+	friend class Array_iterator<T>;
+
+protected:
+
+	// default expand delta size
+	int fdelta;
 
-#include <stddef.h>
+	/// elements[growing size] here
+	T *felements;
 
-#include "pa_types.h"
+	// allocated size
+	int fallocated;
 
-class Pool;
+	// array size
+	int fused;
 
-class Array {
 public:
+	typedef T element_type;
 
-	typedef void *Item;
+	Array(int initial=3, int delta=1):
+		fallocated(initial?initial:3),
+		fdelta(delta),
+		fused(0)
+	{
+		if(fallocated<=0 || fdelta<1)
+			throw Exception(0, 
+				Exception::undefined_source,
+				"Array::Array(%d, %d) too small", initial, delta);
 
-	enum {
-		CR_INITIAL_ROWS_DEFAULT=10,
-		CR_GROW_PERCENT=60
-	};
+		felements=new T[fallocated];
+	}
+	override ~Array() {
+		T *last=felements+fused;
+		for(T *current=felements; current<last; current++)
+			delete current;
 
-public:
+		delete felements;
+	}
 
-	void *operator new(size_t size, Pool *apool);
-	Array(Pool *apool, int initial_rows=CR_INITIAL_ROWS_DEFAULT);
+	/// how many items are in Array
+	int count() const { return fused; }
+	/// append to array
+	Array& operator += (T src) {
+		if(is_full())
+			expand(fdelta);
 
-	int size() { return fused_rows; }
-	Array& operator += (Item src);
-	Array& operator += (Array& src);
-	Item& operator [] (int index);
+		felements[fused++]=src;
 
-protected:
+		return *this;
+	}
+
+	/// 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, 
+				Exception::undefined_source,
+				"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);
 
-	// the pool I'm allocated on
-	Pool *pool;
+		memcpy(&felements[fused+=limit], &src.felements[offset], limit*sizeof(T));
+		return *this;
+	}
 
-private:
+	/// get index-element
+	T& get(int index) {
+		if(!(index>=0 && index<count())) {
+			throw Exception(0, 
+				Exception::undefined_source,
+				"Array::get(%d) out of range [0..%d]", index, count()-1);
+			return felements[0]; // never
+		}
 
-	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;
+		return felements[index];
+	}
 
-private:
+	T& operator [](int index) { return get(index); }
 
-	// array size
-	int fused_rows;
+	/// put index-element
+	void put(int index, T& element) {
+		if(!(index>=0 && index<count())) {
+			throw Exception(0, 
+				Exception::undefined_source, 
+				"Array::put(%d) out of range [0..%d]", index, count()-1);
+			return; // never
+		}
+		felements[index]=element;
+	}
+
+
+	/// 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);
+	}
+
+	/// 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;//T(0);
+	}
 
-	int cache_chunk_base;
-	Chunk *cache_chunk;
-	
-private:
+protected:
 
-	bool chunk_is_full() {
-		return append_here == link_row;
+	bool is_full() {
+		return fused == fallocated;
+	}
+	void expand(int delta) {
+		fallocated+=delta;
+		felements = (T *)realloc(felements, fallocated*sizeof(T));
 	}
-	void expand(int chunk_rows);
 
 private: //disabled
 
-	Array(Array&) {}
-	Array& operator = (Array&) { return *this; }
+	Array& operator = (const Array&) { return *this; }
+};
+
+typedef smart_ptr<char> CharPtr;
+
+class Pool: public Array<CharPtr> {
+public:
+	char *malloc(size_t size) {
+		CharPtr result=CharPtr((char *)Array<CharPtr>::malloc(size));
+		*this += result;
+		return result.get();
+	}
+
+	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;
+	}
+};
+
+inline void *operator new(size_t size, Pool& pool) { 
+	return pool.malloc(size);
+}
+
+/// handy array iterator
+template<typename T> class Array_iterator {
+
+	Array<T>& farray;
+	T *fcurrent;
+	T *flast;
+
+public:
+
+	Array_iterator(Array<T>& aarray): farray(aarray) {
+		fcurrent=farray.felements;
+		flast=farray.felements+farray.count();
+	}
+
+	/// there are still elements
+	bool has_next() {
+		return fcurrent<flast;
+	}
+
+	/// quickly extracts next Array element
+	T next() {
+		return *(fcurrent++);
+	}
+
 };
 
 #endif