parser3/src/main/pa_table.C - diff

Return to pa_table.C CVS log

Up to [parser3project] / parser3 / src / main

Diff for /parser3/src/main/pa_table.C between versions 1.53.2.10.2.5 and 1.77

version 1.53.2.10.2.5, 2003/04/02 08:49:58	version 1.77, 2024/11/04 03:53:25
Line 1	Line 1
/** @file	/** @file
Parser: table class.	Parser: table class.

Copyright (c) 2001-2003 ArtLebedev Group (http://www.artlebedev.com)	Copyright (c) 2001-2024 Art. Lebedev Studio (http://www.artlebedev.com)
Author: Alexandr Petrosian <paf@design.ru> (http://paf.design.ru)	Authors: Konstantin Morshnev <moko@design.ru>, Alexandr Petrosian <paf@design.ru>
*/	*/

static const char* IDENT_TABLE_C="$Date$";

#include "pa_table.h"	#include "pa_table.h"

#include "pa_exception.h"	volatile const char * IDENT_PA_TABLE_C="$Id$" IDENT_PA_TABLE_H;

Table::Table(columns_type acolumns, int initial_rows):	#include "pa_exception.h"
Array<element_type>(initial_rows),

fcurrent(0),	Table::Table(columns_type acolumns, size_t initial_rows): Array<element_type>(initial_rows), fcurrent(0), fcolumns(acolumns), name2number(NULL){
fcolumns(acolumns),	column_names_init();
name2number(new name2number_hash_class) {	}

if(fcolumns) {	void Table::column_names_init(){
size_t fcolumns_count=fcolumns->count();	if(fcolumns){
	name2number = new name2number_hash_class;
size_t number=1;	size_t number=1;
for(Array_iterator<const String> i(fcolumns); i.has_next(); ) {	for(ArrayString::Iterator i(*fcolumns); i; ) {
const String& name=*i.next();	const String& name=*i.next();
name2number->put(name, number++);	name2number->put(name, number++);
}	}
}	}
}	}

Table::Table(const Table& src, int offset, int limit) :	static void append_row(Table& src, Table* dest) {
Array<element_type>(limit/may be more than needed, no harm done/),	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 > src.count() ? src.count() : options.limit),

fcurrent(0),	fcurrent(0),
fcolumns(src.fcolumns),	fcolumns(src.fcolumns),
name2number(src.name2number) {	name2number(src.name2number) {

append(src, offset, limit);	((Table &)src).table_for_each(append_row, this, options);
	}

	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;
}	}

int Table::column_name2index(const String& column_name, bool bark) const {	int Table::column_name2index(const String& column_name, bool bark) const {
if(fcolumns) {// named	if(fcolumns) {// named
int result=name2number->get(column_name)-1; // -1 = column not found	int result=name2number->get(column_name)-1; // -1 = column not found
if(bark && result<0)	if(bark && result<0)
throw Exception("parser.runtime",	throw Exception(PARSER_RUNTIME, &column_name, "column not found");
&column_name,
"column not found");
return result;	return result;
} else // nameless	} else // nameless
return column_name.as_int();	return column_name.as_int();
Line 53 int Table::column_name2index(const Strin	Line 66 int Table::column_name2index(const Strin
const String* Table::item(size_t column) {	const String* Table::item(size_t column) {
if(valid(fcurrent)) {	if(valid(fcurrent)) {
element_type row=get(fcurrent);	element_type row=get(fcurrent);
if(column>=0 && column<row->count()) // proper index?	if(column<row->count()) // proper index?
return row->get(column);	return row->get(column);
}	}
return 0; // it's OK we don't have row\|column, just return nothing	return 0; // it's OK we don't have row\|column, just return nothing
}	}

bool Table::locate(size_t column, const String& value) {	void Table::put_item(size_t column, const String* value) {
size_t scurrent=fcurrent;	if(!valid(fcurrent)) {
size_t lcount=count();	throw Exception(PARSER_RUNTIME, 0, "invalid current row");
for(fcurrent=0; fcurrent<lcount; fcurrent++) {	}
const String* item_value=item(column);	element_type row=get(fcurrent);
if(*item_value == value)	while(row->count()<=column){
return true;	*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--;
	}
	}

fcurrent=scurrent;	#ifndef DOXYGEN
return false;	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) {	bool Table::locate(const String& column, const String& value, Table::Action_options& options) {
return locate(column_name2index(column, true), value);	return locate(column_name2index(column, true), value, options);
}	}

void Table::offset(bool absolute, int offset) {	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())	if(size_t lcount=count())
fcurrent=((absolute?0:fcurrent)+offset+lcount)%lcount;	fcurrent=((absolute?0:fcurrent)+offset+lcount)%lcount;
}	}

E-mail:

Removed from v.1.53.2.10.2.5
changed lines
	Added in v.1.77