--- parser3/src/include/pa_table.h	2001/01/29 20:10:32	1.2
+++ parser3/src/include/pa_table.h	2003/09/25 09:15:02	1.53
@@ -1,49 +1,138 @@
-/*
-  $Id: pa_table.h,v 1.2 2001/01/29 20:10:32 paf Exp $
-*/
+/** @file
+	Parser: table class decl.
 
-/*
-	hence most of tables are "named", no need to uptimize unnamed onces
+	Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com)
+	Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)
 */
 
-
 #ifndef PA_TABLE_H
 #define PA_TABLE_H
 
+static const char* IDENT_TABLE_H="$Date: 2003/09/25 09:15:02 $";
+
 #include "pa_types.h"
-#include "pa_array.h"
 #include "pa_hash.h"
 #include "pa_string.h"
-#include "pa_request.h"
-
-class Table : public Array {
-public:
-
-	// request I'm processed on
-	Request& request;
 
-	// the base origin of table data
-	Origin origin;
+/** 
+	VTable backend.
 
-	int current;
-
-	// columns
-	Array *columns;
-
-	Table(Request& request,
-		char *afile, uint aline,
-		Array *acolumns,
-		int initial_rows=CR_INITIAL_ROWS_DEFAULT);
-
-	char *item(int column_index);
-	char *item(String column_name);
-
-protected:
+	holds:
+	- column names[if any]
+	- data rows
+	- current row pointer
+
+	uses String for column names and data items
+
+	hence most of tables are "named", no need to uptimize nameless onces.
+	rows and strings stored are read-only. once stored they can be removed,
+	but not altered. that's handy for quick copying & co. see table:join
+*/
+class Table: public Array<ArrayString*> {
+public:
+	typedef ArrayString* columns_type;
 
-	// column name->number lookup table
-	Hash name2number;
+	Table(
+		columns_type acolumns,
+		size_t initial_rows=3);
+	Table(const Table& src, Action_options& options);
+
+	/// gets column names
+	columns_type columns() { return fcolumns; }
+
+	/// moves @a current pointer
+	void set_current(size_t acurrent) {
+		assert(acurrent==0 || acurrent<count());
+
+		fcurrent=acurrent;
+	}
+	/// @return current pointer
+	size_t current() const { return fcurrent; }
+	void offset(bool absolute, int offset);
+
+ 	/** @return column index from @a column_name. '<0' if no such column
+		if no such - 'bark'
+	*/
+	int column_name2index(const String& column, bool bark) const;
+
+	/// @return item from @a column
+	const String* item(size_t column);
+
+	/// @return item from @a column. '0' if no such column
+	const String* item(const String& column) {
+		int index=column_name2index(column, false);
+		return index>=0?item(index):0;
+	}
+
+	/// saves to text file
+	void save(bool nameless_save, const String& file_spec);
+
+	template<typename I>
+	void table_for_each(void (*func)(Table& self, I* info), I* info, Action_options& o) {
+		if(!o.adjust(count()))
+			return;
+
+		size_t saved_current=current();
+		size_t row=o.offset;
+		if(o.reverse) { // reverse
+			for(size_t to=row-o.limit; row>=to; --row) {
+				set_current(row);
+				func(*this, info);
+			}
+		} else { // forward
+			for(size_t to=row+o.limit; row<to; row++) {
+				set_current(row);
+				func(*this, info);
+			}
+		}
+		set_current(saved_current);
+	}
+
+	template<typename I>
+	bool table_first_that(bool (*func)(Table& self, I* info), void* info, Action_options& o) {
+		if(!o.adjust(count()))
+			return false;
+
+		size_t saved_current=current();
+		size_t row=o.offset;
+		if(o.reverse) { // reverse
+			for(size_t to=row-o.limit; row>=to; --row) {
+				set_current(row);
+
+				if(func(*this, info))
+					return true;
+			}
+		} else { // forward
+			for(size_t to=row+o.limit; row<to; row++) {
+				set_current(row);
+
+				if(func(*this, info))
+					return true;
+			}
+		}
+		set_current(saved_current);
+
+		return false;
+	}
+
+
+	bool locate(int column, const String& value, Action_options& options);
+	bool locate(const String& column, const String& value, Action_options& options);
+
+private:
+	
+	/// current row
+	size_t fcurrent;
+
+	/// columns
+	columns_type fcolumns;
+
+	/// column name->number lookup table
+	typedef Hash<const String::Body, int> name2number_hash_class;
+	name2number_hash_class* name2number;
 
-	Array *at(int index);
+	/// is that @c index falid?
+	bool valid(size_t index) const { return index>=0 && index<count(); }
 
 };