|
|
| version 1.48.2.11.2.9, 2003/04/14 11:23:41 | version 1.64, 2012/03/16 09:24:11 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: table class decl. | Parser: table class decl. |
| Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001-2012 Art. Lebedev Studio (http://www.artlebedev.com) |
| Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru) | 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$"; | #define IDENT_PA_TABLE_H "$Id$" |
| #include "pa_types.h" | #include "pa_types.h" |
| #include "pa_hash.h" | #include "pa_hash.h" |
| Line 32 class Table: public Array<ArrayString*> | Line 32 class Table: public Array<ArrayString*> |
| public: | public: |
| typedef ArrayString* columns_type; | typedef ArrayString* columns_type; |
| 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( | Table( |
| columns_type acolumns, | columns_type acolumns, |
| size_t initial_rows=3); | size_t initial_rows=3); |
| Line 53 public: | Line 42 public: |
| /// moves @a current pointer | /// moves @a current pointer |
| void set_current(size_t acurrent) { | void set_current(size_t acurrent) { |
| assert(acurrent<count()); | assert(acurrent==0 || acurrent<count()); |
| fcurrent=acurrent; | fcurrent=acurrent; |
| } | } |
| Line 79 public: | Line 68 public: |
| void save(bool nameless_save, const String& file_spec); | void save(bool nameless_save, const String& file_spec); |
| template<typename I> | template<typename I> |
| bool locate(bool (*func)(Table& self, I* info), void* info, Action_options& o) { | void table_for_each(void (*func)(Table& self, I* info), I* info, Action_options& o) { |
| size_t count=this->count(); | if(!o.adjust(count())) |
| if(!count || !o.limit) | return; |
| return false; | |
| size_t saved_current=current(); | |
| size_t row=o.offset; | size_t row=o.offset; |
| if(row>=count) | if(o.reverse) { // reverse |
| return false; | for(size_t i=0; i<o.limit; i++) { |
| // max(limit) | set_current(row-i); |
| size_t m=o.reverse? | func(*this, info); |
| o.offset | } |
| :count-o.offset; | } else { // forward |
| if(!m) | 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; | return false; |
| // fix limit | |
| if(o.limit==ARRAY_OPTION_LIMIT_ALL || o.limit>m) | |
| o.limit=m; | |
| size_t saved_current=current(); | size_t saved_current=current(); |
| size_t row=o.offset; | |
| if(o.reverse) { // reverse | if(o.reverse) { // reverse |
| for(size_t to=row-o.limit; row>=to; --row) { | for(size_t i=0; i<o.limit; i++) { |
| set_current(row); | set_current(row-i); |
| if(func(*this, info)) | if(func(*this, info)) |
| return true; | return true; |
| Line 117 public: | Line 115 public: |
| return false; | return false; |
| } | } |
| bool locate(int column, const String& value, Action_options& options); | bool locate(int column, const String& value, Action_options& options); |
| bool locate(const String& column, const String& value, Action_options& options); | bool locate(const String& column, const String& value, Action_options& options); |
| private: | private: |
| // current row | /// current row |
| size_t fcurrent; | size_t fcurrent; |
| // columns | /// columns |
| columns_type fcolumns; | 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 | typedef HashString<int> name2number_hash_class; |
| typedef Hash<const StringBody, int> name2number_hash_class; | |
| name2number_hash_class* name2number; | name2number_hash_class* name2number; |
| // we own columns? | /// is that @c index falid? |
| bool valid(size_t index) const { return index<count(); } | |
| bool valid(size_t index) const { return index>=0 && index<count(); } | |
| }; | }; |