--- parser3/src/include/pa_table.h 2001/03/26 09:53:42 1.22 +++ parser3/src/include/pa_table.h 2024/12/11 15:46:38 1.78 @@ -1,21 +1,20 @@ /** @file Parser: table class decl. - Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) - - Author: Alexander Petrosyan (http://design.ru/paf) - - $Id: pa_table.h,v 1.22 2001/03/26 09:53:42 paf Exp $ + Copyright (c) 2001-2024 Art. Lebedev Studio (http://www.artlebedev.com) + Authors: Konstantin Morshnev , Alexandr Petrosian */ #ifndef PA_TABLE_H #define PA_TABLE_H +#define IDENT_PA_TABLE_H "$Id: pa_table.h,v 1.78 2024/12/11 15:46:38 moko Exp $" + #include "pa_types.h" -#include "pa_array.h" #include "pa_hash.h" #include "pa_string.h" -#include "pa_request.h" + +class Temp_current; /** VTable backend. @@ -27,51 +26,138 @@ uses String for column names and data items - hence most of tables are "named", no need to uptimize nameless onces + 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 { +class Table: public Array { public: + typedef ArrayString* columns_type; - Table(Pool& apool, - const String *aorigin, - 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); - /// where this table came from, may be NULL - const String *origin_string() { return forigin_string; } + /// gets column names + columns_type columns() { return fcolumns; } - /// column names - const Array *columns() { return fcolumns; } - - /// moves @a current pointer - void set_current(int acurrent) { fcurrent=acurrent; } /// @return current pointer - int get_current() { return fcurrent; } + size_t current() const { return fcurrent; } + + /// sets @a current pointer, can be out of range when restoring current in modified table + void set_current(size_t acurrent) { + fcurrent=acurrent0 ? count()-1 : 0; + } + + /// sets or offsets @a current pointer, wrapping within the table + void offset(bool absolute, int offset); + + /// is that @c index falid? + bool valid(size_t index) const { return index=0?item(index):0; + } + + /// saves to text file + void save(bool nameless_save, const String& file_spec); + + template + void table_for_each(void (*func)(Table& self, I* info), I* info, Action_options& o); + + template + 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; inumber lookup table - Hash name2number; + /// current row + size_t fcurrent; - // current row - int fcurrent; + /// columns + columns_type fcolumns; - // columns - Array *fcolumns; + /// column name->number lookup table + typedef HashString name2number_hash_class; + name2number_hash_class* name2number; - bool valid(int index) { return index>=0 && index void Table::table_for_each(void (*func)(Table& self, I* info), I* info, Action_options& o) { + if(!o.adjust(count())) + return; + + Temp_current tc(*this); + size_t row=o.offset; + if(o.reverse) { // reverse + for(size_t i=0; i