--- parser3/src/include/pa_array.h	2001/03/19 17:42:12	1.26
+++ parser3/src/include/pa_array.h	2024/09/11 21:07:36	1.91
@@ -1,138 +1,373 @@
 /** @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.26 2001/03/19 17:42:12 paf Exp $
+	Copyright (c) 2001-2023 Art. Lebedev Studio (http://www.artlebedev.com)
+	Authors: Konstantin Morshnev <moko@design.ru>, Alexandr Petrosian <paf@design.ru>
 */
 
 #ifndef PA_ARRAY_H
 #define PA_ARRAY_H
 
-#include <stddef.h>
+#define IDENT_PA_ARRAY_H "$Id: pa_array.h,v 1.91 2024/09/11 21:07:36 moko Exp $"
+
+// includes
 
-#include "pa_pool.h"
+#include "pa_memory.h"
 #include "pa_types.h"
-#include "pa_string.h"
+#include "pa_exception.h"
 
-/**	
-	Pooled Array.
+// forwards
 
-	Internal structure: @verbatim	
+template<typename T> class Array_iterator;
+template<typename T> class Array_reverse_iterator;
 
-	Array               Chunk0
-	======              ========
-	head--------------->[ptr]
-	append_here-------->[ptr]
-	link_row            ........
-			.			.
-			.			[ptr]
-			...........>[link to the next chunk]
+// defines
 
-	@endverbatim
-*/
+#define ARRAY_OPTION_LIMIT_ALL ((size_t)-1)
+
+/// Simple Array
+template<typename T> class Array: public PA_Object {
+
+	friend class Array_iterator<T>;
+	friend class Array_reverse_iterator<T>;
+
+protected:
+
+	/// elements[growing size] here
+	T *felements;
+
+	// allocated size
+	size_t fallocated;
+
+	// array size
+	size_t fused;
 
-class Array : public Pooled {
 public:
+	typedef Array_iterator<T> Iterator;
+	typedef Array_reverse_iterator<T> ReverseIterator;
 
-	typedef void Item; ///< Array item type
+	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;
+		}
 
-	enum {
-		CR_INITIAL_ROWS_DEFAULT=10, ///< default preallocated row count
-		CR_GROW_PERCENT=60 ///< each time the Array chunk_is_full() array expanded()
+		
 	};
 
-public:
+	typedef T element_type;
 
-	Array(Pool& apool, int initial_rows=CR_INITIAL_ROWS_DEFAULT);
+	inline Array(size_t initial=0):
+		fallocated(initial),
+		fused(0)
+	{
+		felements=fallocated?(T *)pa_malloc(fallocated*sizeof(T)):0;
+	}
 
-	/// size Array. how many items are in it
-	int size() const { 
-		// for get and quick_get
-		cache_chunk_base=0;
-		cache_chunk=head;
-		return fused_rows; 
+#ifdef USE_DESTRUCTORS 
+	inline ~Array(){
+		if(felements)
+			pa_free(felements);
 	}
-	/// append Item to array
-	Array& operator += (Item *src);
+#endif
+
+	/// how many items are in Array
+	inline size_t count() const { return fused; }
+	/// append to array
+	inline Array& operator+=(T src) {
+		if(is_full())
+			expand(fallocated>0? 2+fallocated/32 : 3); // 3 is PAF default, confirmed by tests
 
-	/// dirty hack to allow constant items storage. I long for Array<const Item*>
-	Array& operator += (const Item *src) { return *this+=const_cast<Item*>(src); }
+		felements[fused++]=src;
+
+		return *this;
+	}
 
 	/// append other Array portion to this one. starting from offset
-	Array& append_array(const Array& src, int offset=0);
+	Array& append(const Array& src, 
+		size_t offset=0, 
+		size_t limit=ARRAY_OPTION_LIMIT_ALL) { //< negative limit means 'all'. zero limit means 'nothing'
+
+		size_t src_count=src.count();
+		// skip tivials
+		if(!src_count || !limit || offset>=src_count)
+			return *this;
+		// max(limit)
+		size_t m=src_count-offset;
+		// fix limit
+		if(limit==ARRAY_OPTION_LIMIT_ALL || limit>m)
+			limit=m;
+
+		ssize_t delta=limit-(fallocated-fused);
+		if(delta>0)
+			expand(delta);
+
+		T* from=&src.felements[offset];
+		T* to=&felements[fused];
+		for(T* from_end=from+limit; from<from_end; from++)
+			*to++=*from;
+		fused+=limit;
+		return *this;
+	}
 
-	/** 
-		quickly gets some item considering...
+	/// get index-element
+	inline T get(size_t index) const {
+		assert(index<count());
+		return felements[index];
+	}
 
-		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;
-		}
-		
-		return cache_chunk->rows[index-cache_chunk_base].item;
+	/// ref version of get
+	inline T& get_ref(size_t index) const {
+		assert(index<count());
+		return felements[index];
 	}
 
-	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 static_cast<const String *>(get(index)); 
+	/// put index-element
+	inline void put(size_t index, T element) {
+		assert(index<count());
+		felements[index]=element;
 	}
 
-private:
+	/// insert index-element
+	inline void insert(size_t index, T element) {
+		assert(index<=count());
 
-	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
+		if(is_full())
+			expand(fallocated>0? 2+fallocated/32 : 3); // 3 is PAF default, confirmed by tests
+
+		memmove(felements+index+1, felements+index, (fused-index) * sizeof(T));
+
+		felements[index]=element;
+		fused++;
 	}
-		*head;  // the head chunk of the chunk chain
 
-	// last allocated chunk
-	// helps appending Arrays
-	Chunk *tail;
+	/// remove index-element
+	inline void remove(size_t index) {
+		assert(index<count());
+		if (index<--fused)
+			memmove(felements+index, felements+index+1, (fused-index) * sizeof(T));
+	}
 
-	// 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;
+	inline T operator [](size_t index) const { return get(index); }
 
-private:
+	inline void clear() {
+		if(fused)
+			memset(felements, 0, fused * sizeof(T));
+		fused=0;
+	}
 
-	// array size
-	int fused_rows;
+	/// 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
+	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;
+		for(T *current=felements; current<last; current++)
+			if(callback(*current, info))
+				return *current;
+
+		return T(0);
+	}
+
+	inline T* ptr(size_t index){
+		return felements + index;
+	}
+
+	void fit(size_t index, T element){
+		if(index >= fallocated){
+			size_t new_allocated=fallocated>0 ? fallocated : 3;
+			while(new_allocated <= index){
+				new_allocated+=2 + new_allocated/32;
+			}
+			expand(new_allocated - fallocated);
+		}
+		felements[index]=element;
+		if(index >= fused){
+			fused=index+1;
+		}
+	}
 
-	mutable int cache_chunk_base;
-	mutable Chunk *cache_chunk;
-	
-private:
+protected:
 
-	bool chunk_is_full() {
-		return append_here == link_row;
+	bool is_full() {
+		return fused == fallocated;
+	}
+
+	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));
+		}
 	}
-	void expand(int chunk_rows);
 
 private: //disabled
 
-	//Array(Array&) { }
+	Array(const Array&) {}
 	Array& operator = (const Array&) { return *this; }
 };
 
+/// Commonly used, templated to work with any integer type
+
+template<typename T> char* pa_itoa(T n, T base=10){
+	char buf[MAX_NUMBER + 1];
+	char* pos=buf + MAX_NUMBER;
+	*pos='\0';
+
+	bool negative=n < 0;
+	if (n < 0){
+		n=-n;
+	}
+
+	do {
+		*(--pos)=(n % base) + '0';
+		n/=base;
+	} while (n > 0);
+
+	if (negative) {
+		*(--pos) = '-';
+	}
+	return pa_strdup(pos, buf + MAX_NUMBER - pos);
+}
+
+template<typename T> char* pa_uitoa(T n, T base=10){
+	char buf[MAX_NUMBER + 1];
+	char* pos=buf + MAX_NUMBER;
+	*pos='\0';
+
+	do {
+		*(--pos)=(n % base) + '0';
+		n/=base;
+	} while (n > 0);
+
+	return pa_strdup(pos, buf + MAX_NUMBER - pos);
+}
+
+
+/** Array iterator, usage:
+	@code
+	// Array<T> a;
+	for(Array_iterator<T> i(a); i; ) {
+		T& element=i.next();
+		...
+	}	
+	@endcode
+*/
+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.felements + farray.count();
+	}
+
+	/// there are still elements
+	inline operator bool () {
+		return fcurrent < flast;
+	}
+
+	/// returns the current element and advances the iterator
+	inline T next() {
+		return *(fcurrent++);
+	}
+
+	/// returns the current element
+	inline T value() {
+		return *(fcurrent);
+	}
+
+	// returns the current index of the iterator
+	inline size_t index() {
+		return fcurrent - farray.felements;
+	}
+
+	inline char *key(){
+		return pa_uitoa(index());
+	}
+
+};
+
+template<typename T> class Array_reverse_iterator {
+
+	const Array<T>& farray;
+	T *fcurrent;
+
+public:
+
+	Array_reverse_iterator(const Array<T>& aarray): farray(aarray) {
+		fcurrent=farray.felements+farray.count();
+	}
+
+	/// there are still elements
+	inline operator bool () {
+		return fcurrent > farray.felements;
+	}
+
+	/// returns the current element and advances the iterator
+	inline T prev() {
+		return *(--fcurrent);
+	}
+
+	// returns the current index of the iterator
+	inline size_t index() {
+		return fcurrent - farray.felements;
+	}
+
+	inline char *key(){
+		return pa_uitoa(index());
+	}
+
+};
 #endif