--- parser3/src/include/pa_array.h	2001/02/11 11:27:24	1.13
+++ parser3/src/include/pa_array.h	2001/03/10 16:34:34	1.21
@@ -1,5 +1,9 @@
 /*
-  $Id: pa_array.h,v 1.13 2001/02/11 11:27:24 paf Exp $
+	Parser
+	Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
+	Author: Alexander Petrosyan <paf@design.ru>
+
+	$Id: pa_array.h,v 1.21 2001/03/10 16:34:34 paf Exp $
 */
 
 /*
@@ -38,10 +42,34 @@ public:
 
 	Array(Pool& apool, int initial_rows=CR_INITIAL_ROWS_DEFAULT);
 
-	int size() const { return fused_rows; }
-	Array& operator += (const Item *src);
-	Array& append_array(const Array& src);
-	const Item *get(int index) const;
+	int size() const { 
+		// for get and quick_get
+		cache_chunk_base=0;
+		cache_chunk=head;
+		return fused_rows; 
+	}
+	Array& operator += (Item *src);
+	// Array<const Item*> replacement
+	Array& operator += (const Item *src) { return *this+=const_cast<Item*>(src); }
+	Array& append_array(const Array& src, int offset=0);
+	Item *quick_get(int index) const {
+		// considering these true:
+		//   index increments from 0 to size()-1
+		//   index>=0 && index<size()
+		//   index>=cache_chunk_base
+
+		// 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;
+	}
+
+	Item *get(int index) const;
+	void put(int index, Item *item);
 	const char *get_cstr(int index) const { 
 		return static_cast<const char *>(get(index)); 
 	}
@@ -55,7 +83,7 @@ private:
 		// the number of rows in chunk
 		int count;
 		union Row {
-			const Item *item;
+			Item *item;
 			Chunk *link;  // link to the next chunk in chain
 		} rows[1];
 		// next rows are here