|
|
| version 1.17, 2001/03/25 08:52:36 | version 1.75, 2024/09/07 16:30:27 |
|---|---|
| Line 1 | Line 1 |
| /** @file | /** @file |
| Parser: table class. | Parser: table class. |
| Copyright (c) 2001 ArtLebedev Group (http://www.artlebedev.com) | Copyright (c) 2001-2023 Art. Lebedev Studio (http://www.artlebedev.com) |
| Authors: Konstantin Morshnev <moko@design.ru>, Alexandr Petrosian <paf@design.ru> | |
| */ | |
| Author: Alexander Petrosyan <paf@design.ru> (http://design.ru/paf) | #include "pa_table.h" |
| $Id$ | volatile const char * IDENT_PA_TABLE_C="$Id$" IDENT_PA_TABLE_H; |
| */ | |
| #include <stdlib.h> | #include "pa_exception.h" |
| #include "pa_table.h" | Table::Table(columns_type acolumns, size_t initial_rows): Array<element_type>(initial_rows), fcurrent(0), fcolumns(acolumns), name2number(NULL){ |
| #include "pa_pool.h" | column_names_init(); |
| } | |
| Table::Table(Pool& apool, | void Table::column_names_init(){ |
| Array *acolumns, | if(fcolumns){ |
| int initial_rows) : | name2number = new name2number_hash_class; |
| Array(apool, initial_rows), | size_t number=1; |
| for(ArrayString::Iterator i(*fcolumns); i; ) { | |
| const String& name=*i.next(); | |
| name2number->put(name, number++); | |
| } | |
| } | |
| } | |
| static void append_row(Table& src, Table* dest) { | |
| Table::element_type src_row(src[src.current()]); | |
| Table::element_type row(new ArrayString(src_row->count())); | |
| row->append(*src_row); | |
| *dest+=row; | |
| } | |
| Table::Table(const Table& src, Action_options& options) : | |
| Array<element_type>( (options.limit==ARRAY_OPTION_LIMIT_ALL || options.limit>src.count()) ? src.count() : options.limit), | |
| fcurrent(0), | fcurrent(0), |
| fcolumns(acolumns), | fcolumns(src.fcolumns), |
| name2number(pool(), false) { | name2number(src.name2number) { |
| if(fcolumns) | ((Table &)src).table_for_each(append_row, this, options); |
| for(int i=0; i<fcolumns->size(); i++) { | } |
| const String& name=*fcolumns->get_string(i); | |
| name2number.put(name, i+1); | size_t Table::max_cells() const { |
| } | size_t result=0; |
| for(size_t i=0; i<count(); i++){ | |
| element_type row=get(i); | |
| if(row->count()>result) | |
| result=row->count(); | |
| } | |
| return result; | |
| } | } |
| const Array &Table::at(int index) { | int Table::column_name2index(const String& column_name, bool bark) const { |
| return *const_cast<const Array *>(static_cast<Array *>(get(index))); | if(fcolumns) {// named |
| int result=name2number->get(column_name)-1; // -1 = column not found | |
| if(bark && result<0) | |
| throw Exception(PARSER_RUNTIME, &column_name, "column not found"); | |
| return result; | |
| } else // nameless | |
| return column_name.as_int(); | |
| } | } |
| const String *Table::item(const String& column_name) { | const String* Table::item(size_t column) { |
| int column_index; | if(valid(fcurrent)) { |
| if(fcolumns) { // named | element_type row=get(fcurrent); |
| int found_index=name2number.get_int(column_name); | if(column<row->count()) // proper index? |
| if(found_index) | return row->get(column); |
| column_index=found_index-1; | |
| else | |
| THROW(0, 0, | |
| &column_name, | |
| "column not found"); | |
| } else { // nameless | |
| column_index=atoi(column_name.cstr()); | |
| if(!valid(fcurrent)) | |
| return 0; // it's OK we don't have row, just return nothing | |
| const Array& row=at(fcurrent); | |
| if(column_index<0 || column_index>=row.size()) // read past proper index? | |
| return 0; // it's OK we don't have column, just return nothing | |
| } | } |
| return 0; // it's OK we don't have row|column, just return nothing | |
| } | |
| void Table::put_item(size_t column, const String* value) { | |
| if(!valid(fcurrent)) { | |
| throw Exception(PARSER_RUNTIME, 0, "invalid current row"); | |
| } | |
| element_type row=get(fcurrent); | |
| while(row->count()<=column){ | |
| *row+=&String::Empty; | |
| } | |
| row->put(column, value); | |
| } | |
| void Table::remove_current(){ | |
| if(!valid(fcurrent)) { | |
| throw Exception(PARSER_RUNTIME, 0, "invalid current row"); | |
| } | |
| remove(fcurrent); | |
| if(fcurrent==count() && count()>0){ | |
| fcurrent--; | |
| } | |
| } | |
| #ifndef DOXYGEN | |
| struct Locate_int_string_info { | |
| int column; | |
| const String* value; | |
| }; | |
| #endif | |
| bool locate_int_string(Table& self, Locate_int_string_info* info) { | |
| const String *item_value=self.item(info->column); | |
| return item_value && *item_value==*info->value; | |
| } | |
| bool Table::locate(int column, const String& value, Table::Action_options& options) { | |
| Locate_int_string_info info={column, &value}; | |
| return table_first_that(locate_int_string, &info, options); | |
| } | |
| bool Table::locate(const String& column, const String& value, Table::Action_options& options) { | |
| return locate(column_name2index(column, true), value, options); | |
| } | |
| return item(column_index); | void Table::offset(bool absolute, int offset) { |
| // not +lcount, but "if either operand is unsigned, the other shall be converted to unsigned" C++ rule works here | |
| if(size_t lcount=count()) | |
| fcurrent=((absolute?0:fcurrent)+offset+lcount)%lcount; | |
| } | } |