--- parser3/src/include/pa_table.h 2001/01/29 20:46:22 1.3 +++ parser3/src/include/pa_table.h 2003/04/14 11:23:41 1.48.2.11.2.9 @@ -1,49 +1,141 @@ -/* - $Id: pa_table.h,v 1.3 2001/01/29 20:46:22 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 (http://paf.design.ru) */ - #ifndef PA_TABLE_H #define PA_TABLE_H +static const char* IDENT_TABLE_H="$Date: 2003/04/14 11:23:41 $"; + #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; +/** + VTable backend. - // the base origin of table data - Origin origin; + 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 { +public: + typedef ArrayString* columns_type; - int current; + struct Action_options { + size_t offset; + size_t limit; //< negative limit means 'all'. zero limit means 'nothing' + bool reverse; + bool defined; + + Action_options(): + offset(0), limit(ARRAY_OPTION_LIMIT_ALL), reverse(false), + defined(false) {} + }; + + 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?item(index):0; + } + + /// saves to text file + void save(bool nameless_save, const String& file_spec); + + template + bool locate(bool (*func)(Table& self, I* info), void* info, Action_options& o) { + size_t count=this->count(); + if(!count || !o.limit) + return false; + size_t row=o.offset; + if(row>=count) + return false; + // max(limit) + size_t m=o.reverse? + o.offset + :count-o.offset; + if(!m) + return false; + // fix limit + if(o.limit==ARRAY_OPTION_LIMIT_ALL || o.limit>m) + o.limit=m; + + size_t saved_current=current(); + 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; rownumber lookup table - Hash name2number; + typedef Hash name2number_hash_class; + name2number_hash_class* name2number; + + // we own columns? - const Array *at(int index); + bool valid(size_t index) const { return index>=0 && index