|
|
| version 1.1, 2001/01/29 15:56:03 | version 1.48.2.11.2.6, 2003/03/26 18:52:49 |
|---|---|
| Line 1 | Line 1 |
| /* | /** @file |
| $Id$ | Parser: table class decl. |
| Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com) | |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | |
| */ | */ |
| #ifndef PA_TABLE_H | #ifndef PA_TABLE_H |
| #define PA_TABLE_H | #define PA_TABLE_H |
| static const char* IDENT_TABLE_H="$Date$"; | |
| #include "pa_types.h" | #include "pa_types.h" |
| #include "pa_array.h" | |
| #include "pa_hash.h" | #include "pa_hash.h" |
| #include "pa_string.h" | |
| /** | |
| VTable backend. | |
| holds: | |
| - column names[if any] | |
| - data rows | |
| - current row pointer | |
| class Table : public Array { | 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: | public: |
| typedef ArrayString* columns_type; | |
| // the base origin of table data | Table( |
| Origin origin; | columns_type acolumns, |
| int initial_rows=3); | |
| Table(const Table& src, int offset=0, int limit=0); | |
| /// gets column names | |
| columns_type columns() { return fcolumns; } | |
| /// moves @a current pointer | |
| void set_current(int acurrent) { fcurrent=acurrent; } | |
| /// @return current pointer | |
| int 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); | |
| bool locate(size_t column, const String& value); | |
| bool locate(const String& column, const String& value); | |
| private: | |
| // current row | |
| size_t fcurrent; | |
| // columns order | // columns |
| Array *columns_order; | columns_type fcolumns; |
| // column names are already referenced in fcolumns, no need to doublecheck references here | |
| // column name->number lookup table | // column name->number lookup table |
| // hence most of tables are "named", no need to uptimize unnamed onces | typedef Hash<const StringBody, int> name2number_hash_class; |
| Hash name2number; | name2number_hash_class* name2number; |
| // we own columns? | |
| bool valid(size_t index) const { return index>=0 && index<count(); } | |
| Table(Pool *apool, | |
| char *afile, uint aline, | |
| Array *acolumns, | |
| int initial_rows=CR_INITIAL_ROWS_DEFAULT); | |
| }; | }; |
| #endif | #endif |