--- parser3/src/main/Attic/pa_array.C	2001/03/11 08:16:34	1.22
+++ parser3/src/main/Attic/pa_array.C	2001/05/17 19:33:33	1.35
@@ -1,19 +1,22 @@
-/*
-	Parser
+/** @file
+	Parser: array class.
+
 	Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
+
 	Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
 
-	$Id: pa_array.C,v 1.22 2001/03/11 08:16:34 paf Exp $
+	$Id: pa_array.C,v 1.35 2001/05/17 19:33:33 parser Exp $
 */
 
-#include <string.h>
-
 #include "pa_pool.h"
 #include "pa_array.h"
 #include "pa_exception.h"
+#include "pa_common.h"
 
 Array::Array(Pool& apool, int initial_rows) :
 	Pooled(apool) {
+	initial_rows=max(initial_rows, CR_INITIAL_ROWS_DEFAULT);
+
 	head=tail=static_cast<Chunk *>(
 		malloc(sizeof(int)+sizeof(Chunk::Row)*initial_rows+sizeof(Chunk *)));
 	head->count=initial_rows;
@@ -27,9 +30,6 @@ Array::Array(Pool& apool, int initial_ro
 }
 
 void Array::expand(int chunk_rows) {
-	if(chunk_rows<CR_INITIAL_ROWS_DEFAULT)
-		chunk_rows=CR_INITIAL_ROWS_DEFAULT;
-
 	Chunk *chunk=tail=static_cast<Chunk *>(
 		malloc(sizeof(int)+sizeof(Chunk::Row)*chunk_rows+sizeof(Chunk *)));
 	chunk->count=chunk_rows;
@@ -42,7 +42,7 @@ void Array::expand(int chunk_rows) {
 
 Array& Array::operator += (Item *src) {
 	if(chunk_is_full())
-		expand(tail->count*CR_GROW_PERCENT/100);
+		expand(tail->count+CR_GROW_COUNT);
 
 	append_here->item=src;
 	append_here++; fused_rows++;
@@ -54,7 +54,7 @@ Array::Item *Array::get(int index) const
 	if(!(index>=0 && index<size())) {
 		THROW(0, 0, 0, 
 			"Array::get(%d) out of range [0..%d]", index, size()-1);
-		return 0;
+		return 0; // never
 	}
 
 	// if they ask index to the left of cached position, forget cache
@@ -77,7 +77,7 @@ void Array::put(int index, Item *item) {
 	if(!(index>=0 && index<size())) {
 		THROW(0, 0, 0, 
 			"Array::put(%d) out of range [0..%d]", index, size()-1);
-		return;
+		return; // never
 	}
 
 	// if they ask index to the left of cached position, forget cache
@@ -145,3 +145,77 @@ Array& Array::append_array(const Array&
 
 	return *this;
 }
+
+void Array::for_each(For_each_func func, void *info) const {
+	Chunk *chunk=head;
+	while(true) {
+		if(chunk==tail) { // last chunk?
+			for(Chunk::Row *row=chunk->rows; row!=append_here; row++)
+				(*func)(row->item, info);
+			break;
+		} else {
+			int count=chunk->count;
+			for(int i=0; i<count; i++)
+				(*func)(chunk->rows[i].item, info);
+			chunk=chunk->rows[count].link;
+		}
+	}
+}
+
+/*void Array::for_each(For_each_func_const func, const void *info) const {
+	Chunk *chunk=head;
+	while(true) {
+		if(chunk==tail) { // last chunk?
+			for(Chunk::Row *row=chunk->rows; row!=append_here; row++)
+				(*func)(row->item, info);
+			break;
+		} else {
+			int count=chunk->count;
+			for(int i=0; i<count; i++)
+				(*func)(chunk->rows[i].item, info);
+			chunk=chunk->rows[count].link;
+		}
+	}
+}
+*/
+Array::Item* Array::first_that(First_that_func_const func, const void *info) const {
+	Chunk *chunk=head;
+	while(true) {
+		if(chunk==tail) { // last chunk?
+			for(Chunk::Row *row=chunk->rows; row!=append_here; row++)
+				if((*func)(row->item, info))
+					return row->item;
+			break;
+		} else {
+			int count=chunk->count;
+			for(int i=0; i<count; i++) {
+				Item* item=chunk->rows[i].item;
+				if((*func)(item, info))
+					return item;
+			}
+			chunk=chunk->rows[count].link;
+		}
+	}
+	return 0;
+}
+
+Array::Item* Array::first_that(First_that_func func, void *info) const {
+	Chunk *chunk=head;
+	while(true) {
+		if(chunk==tail) { // last chunk?
+			for(Chunk::Row *row=chunk->rows; row!=append_here; row++)
+				if((*func)(row->item, info))
+					return row->item;
+			break;
+		} else {
+			int count=chunk->count;
+			for(int i=0; i<count; i++) {
+				Item* item=chunk->rows[i].item;
+				if((*func)(item, info))
+					return item;
+			}
+			chunk=chunk->rows[count].link;
+		}
+	}
+	return 0;
+}