--- parser3/src/include/pa_table.h	2001/03/12 20:55:15	1.13
+++ parser3/src/include/pa_table.h	2023/09/26 20:49:08	1.73
@@ -1,64 +1,147 @@
-/*
-	Parser
-	Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com)
-	Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf)
+/** @file
+	Parser: table class decl.
 
-	$Id: pa_table.h,v 1.13 2001/03/12 20:55:15 paf Exp $
+	Copyright (c) 2001-2023 Art. Lebedev Studio (http://www.artlebedev.com)
+	Authors: Konstantin Morshnev <moko@design.ru>, Alexandr Petrosian <paf@design.ru>
 */
 
-/*
-	hence most of tables are "named", no need to uptimize nameless onces
-*/
-
-
 #ifndef PA_TABLE_H
 #define PA_TABLE_H
 
+#define IDENT_PA_TABLE_H "$Id: pa_table.h,v 1.73 2023/09/26 20:49:08 moko Exp $"
+
 #include "pa_types.h"
-#include "pa_array.h"
 #include "pa_hash.h"
 #include "pa_string.h"
-#include "pa_request.h"
 
-class Table : public Array {
+/** 
+	VTable backend.
+
+	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;
 
-	Table(Pool& apool,
-		const String& asource,
-		Array *acolumns,
-		int initial_rows=CR_INITIAL_ROWS_DEFAULT);
+	Table(columns_type acolumns, size_t initial_rows=3);
+	Table(const Table& src, Action_options& options);
 
-	// the source of table's data
-	const String& source() { return fsource; }
+	/// gets column names
+	columns_type columns() { return fcolumns; }
 
-	const Array *columns() { return fcolumns; }
+	/// moves @a current pointer
+	void set_current(size_t acurrent) {
+		assert(acurrent==0 || acurrent<count());
 
-	void set_current(int acurrent) { fcurrent=acurrent; }
-	int get_current() { return fcurrent; }
+		fcurrent=acurrent;
+	}
+	/// @return current pointer
+	size_t current() const { return fcurrent; }
+	void offset(bool absolute, int offset);
 
-	const String *item(const String& column_name);
+	/// @return checks all rows to find maximum cells number
+	size_t max_cells() const;
 
-private:
+	/** @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;
 
-	// the base origin of table's data
-	const String& fsource;
+	void column_names_init();
 
-	// column name->number lookup table
-	Hash name2number;
+	/// @return item from @a column
+	const String* item(size_t column);
 
-	// current row
-	int fcurrent;
+	/// sets @a column value
+	void put_item(size_t column, const String*);
 
-	// columns
-	Array *fcolumns;
+	/// removes current row
+	void remove_current();
 
-	bool valid(int index) { return index>=0 && index<size();	}
+	/// @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;
+	}
 
-	const Array& at(int index);
+	/// saves to text file
+	void save(bool nameless_save, const String& file_spec);
 
-	const String *item(int column_index) {
-		return valid(fcurrent)?at(fcurrent).get_string(column_index):0;
+	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 i=0; i<o.limit; i++) {
+				set_current(row-i);
+				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), I 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 i=0; i<o.limit; i++) {
+				set_current(row-i);
+
+				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 HashString<int> name2number_hash_class;
+	name2number_hash_class* name2number;
+
+	/// is that @c index falid?
+	bool valid(size_t index) const { return index<count(); }
+
 };
 
 #endif