--- parser3/src/include/pa_array.h	2003/02/17 09:56:15	1.57.2.22
+++ parser3/src/include/pa_array.h	2009/04/30 04:40:30	1.78
@@ -1,71 +1,101 @@
 /** @file
 	Parser: Array & Array_iterator classes decls.
 
-	Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com)
+	Copyright (c) 2001-2009 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/02/17 09:56:15 $";
+static const char * const IDENT_ARRAY_Y="$Date: 2009/04/30 04:40:30 $";
 
-#include "pa_pool.h"
+// includes
+
+#include "pa_memory.h"
 #include "pa_exception.h"
 
+// forwards
+
 template<typename T> class Array_iterator;
 
-/**	
-	Simple Array.
+// defines
 
-*/
+#define ARRAY_OPTION_LIMIT_ALL ((size_t)-1)
+
+/// Simple Array
 template<typename T> class Array: public PA_Object {
 
 	friend class Array_iterator<T>;
 
 protected:
 
-	// default expand delta size
-	int fdelta;
-
 	/// elements[growing size] here
 	T *felements;
 
 	// allocated size
-	int fallocated;
+	size_t fallocated;
 
 	// array size
-	int fused;
+	size_t fused;
 
 public:
+	struct Action_options {
+		size_t offset;
+		size_t limit; //< ARRAY_OPTION_LIMIT_ALL means 'all'. zero limit means 'nothing'
+		bool reverse;
+		bool defined;
+		
+		Action_options(
+			size_t aoffset=0, 
+			size_t alimit=ARRAY_OPTION_LIMIT_ALL, 
+			bool areverse=false): 
+			offset(aoffset), limit(alimit), reverse(areverse), 
+			defined(false) {}
+
+		bool adjust(size_t count) {
+			if(!count || !limit)
+				return false;
+			if(offset>=count)
+				return false;
+			// max(limit)
+			size_t m=reverse?
+				offset+1
+				:count-offset;
+			if(!m)
+				return false;
+			// fix limit
+			if(limit==ARRAY_OPTION_LIMIT_ALL || limit>m)
+				limit=m;
+
+			return true;
+		}
+
+		
+	};
+
 	typedef T element_type;
 
-	Array(int initial=3, int delta=1):
-		fallocated(initial?initial:3),
-		fdelta(delta),
+	inline Array(size_t initial=0):
+		fallocated(initial),
 		fused(0)
 	{
-		if(fallocated<=0 || fdelta<1)
-			throw Exception(0, 
-				Exception::undefined_source,
-				"Array::Array(%d, %d) too small", initial, delta);
-
-		felements=static_cast<T*>(calloc(fallocated*sizeof(T)));
+		felements=fallocated?(T *)pa_malloc(fallocated*sizeof(T)):0;
 	}
-	override ~Array() {
-		T *last=felements+fused;
-		for(T *current=felements; current<last; current++)
-			current->~T(); // manually invoking destructors
 
-		free(felements);
+#ifdef USE_DESTRUCTORS 
+	inline ~Array(){
+		if(felements)
+			pa_free(felements);
 	}
+#endif
 
 	/// how many items are in Array
-	int count() const { return fused; }
+	inline size_t count() const { return fused; }
 	/// append to array
-	Array& operator += (T src) {
+	inline Array& operator+=(T src) {
 		if(is_full())
-			expand(fdelta);
+			expand(fallocated>0?2:3); // 3 is PAF default, confirmed by tests
 
 		felements[fused++]=src;
 
@@ -73,55 +103,65 @@ 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())) {
-			throw Exception(0, 
-				Exception::undefined_source,
-				"Array::append(offset=%d) out of range [0..%d]", offset, src.count()-1);
-			//return 0; // never
-		}
+	Array& append(const Array& src, 
+		size_t offset=0, 
+		size_t limit=ARRAY_OPTION_LIMIT_ALL, //< negative limit means 'all'. zero limit means 'nothing'
+		bool reverse=false) {
+
+		size_t src_count=src.count();
+		// skip tivials
+		if(!src_count || !limit || offset>=src_count)
+			return *this;
+		// max(limit)
+		size_t m=reverse?
+			1+offset
+			:src_count-offset;
+		if(!m)
+			return *this;
 		// 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);
+		if(limit==ARRAY_OPTION_LIMIT_ALL || limit>m)
+			limit=m;
 
-		memcpy(&felements[fused+=limit], &src.felements[offset], limit*sizeof(T));
+		ssize_t delta=reverse?
+			(ssize_t)limit
+			:limit-(fallocated-fused);
+		if(delta>0)
+			expand(delta);
+
+		T* from=&src.felements[offset];
+		T* to=&felements[fused];
+		if(reverse) { // reverse
+			for(T* from_end=from-limit; from>from_end; --from)
+				*to++=*from;
+
+		} else { // forward
+			for(T* from_end=from+limit; from<from_end; from++)
+				*to++=*from;
+		}
+		
+		fused+=limit;
 		return *this;
 	}
 
 	/// get index-element
-	T& get(int index) const {
-		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
-		}
-
+	inline T get(size_t index) const {
+		assert(index<count());
 		return felements[index];
 	}
 
-	T& operator [](int index) const { return get(index); }
+	/// ref version of get
+	inline T& get_ref(size_t index) const {
+		assert(index<count());
+		return felements[index];
+	}
 
 	/// 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
-		}
+	inline void put(size_t index, T element) {
+		assert(index<count());
 		felements[index]=element;
 	}
 
+	inline T operator [](size_t index) const { return get(index); }
 
 	/// iterate over all elements
 	template<typename I> void for_each(void (*callback)(T, I), I info) const {
@@ -130,6 +170,21 @@ public:
 			callback(*current, info);
 	}
 
+	/// iterate over all elements
+	template<typename I> void for_each(bool (*callback)(T, I), I info) const {
+		T *last=felements+fused;
+		for(T *current=felements; current<last; current++)
+			if(callback(*current, info))
+				return;
+	}
+
+	/// iterate over all elements
+	template<typename I> void for_each_ref(void (*callback)(T&, I), I info) {
+		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;
@@ -140,60 +195,51 @@ public:
 		return T(0);
 	}
 
+	inline T* ptr(size_t index){
+		return felements + index;
+	}
+
 protected:
 
 	bool is_full() {
 		return fused == fallocated;
 	}
-	void expand(int delta) {
-		felements = (T *)realloc(felements, (fallocated+delta)*sizeof(T));
-		memset(&felements[fallocated], 0, delta*sizeof(T));
-		fallocated+=delta;
+	void expand(size_t delta) {
+		if(fallocated){
+			size_t new_allocated=fallocated+delta;
+			felements=(T *)pa_realloc(felements, new_allocated*sizeof(T));
+			fallocated=new_allocated;
+		} else {
+			fallocated=delta;
+			felements=(T *)pa_malloc(fallocated*sizeof(T));
+		}
 	}
 
 private: //disabled
 
+	Array(const Array&) {}
 	Array& operator = (const Array&) { return *this; }
 };
 
-typedef smart_ptr<char> CharPtr;
 
-/** 
-	Pool mechanizm allows users not to free up allocated memory,
-	leaving that problem to 'pools'.
+/** Array iterator, usage:
+	@code
+	// Array<T> a;
+	for(Array_iterator<T> i(a); i.has_next(); ) {
+		T& element=i.next();
+		...
+	}	
+	@endcode
 */
-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;
+	const Array<T>& farray;
 	T *fcurrent;
 	T *flast;
 
 public:
 
-	Array_iterator(Array<T>& aarray): farray(aarray) {
+	Array_iterator(const Array<T>& aarray): farray(aarray) {
 		fcurrent=farray.felements;
 		flast=farray.felements+farray.count();
 	}
@@ -204,10 +250,9 @@ public:
 	}
 
 	/// quickly extracts next Array element
-	T& next() {
+	T next() {
 		return *(fcurrent++);
 	}
 
 };
-
 #endif