parser3/src/include/pa_table.h - diff

Return to pa_table.h CVS log

Up to [parser3project] / parser3 / src / include

Diff for /parser3/src/include/pa_table.h between versions 1.48.2.11.2.9 and 1.75

version 1.48.2.11.2.9, 2003/04/14 11:23:41	version 1.75, 2024/11/16 02:57:05
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-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>
*/	*/

#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"
#include "pa_string.h"	#include "pa_string.h"

	class Temp_current;

/**	/**
VTable backend.	VTable backend.

Line 32 class Table: public Array<ArrayString*>	Line 34 class Table: public Array<ArrayString*>
public:	public:
typedef ArrayString* columns_type;	typedef ArrayString* columns_type;

struct Action_options {	Table(columns_type acolumns, size_t initial_rows=3);
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);	Table(const Table& src, Action_options& options);

/// gets column names	/// gets column names
columns_type columns() { return fcolumns; }	columns_type columns() { return fcolumns; }

/// moves @a current pointer	/// moves @a current pointer, can be out of range when restoring current in modified table
void set_current(size_t acurrent) {	void set_current(size_t acurrent) {
assert(acurrent<count());	fcurrent=acurrent<count() ? acurrent : count()>0 ? count()-1 : 0;

fcurrent=acurrent;
}	}

/// @return current pointer	/// @return current pointer
size_t current() const { return fcurrent; }	size_t current() const { return fcurrent; }
void offset(bool absolute, int offset);	void offset(bool absolute, int offset);

/** @return column index from @a column_name. '<0' if no such column	/// @return checks all rows to find maximum cells number
	size_t max_cells() const;

	/** @return column index from @a column_name. '<0' if no such column
if no such - 'bark'	if no such - 'bark'
*/	*/
int column_name2index(const String& column, bool bark) const;	int column_name2index(const String& column, bool bark) const;

	void column_names_init();

/// @return item from @a column	/// @return item from @a column
const String* item(size_t column);	const String* item(size_t column);

	/// sets @a column value
	void put_item(size_t column, const String*);

	/// removes current row
	void remove_current();

/// @return item from @a column. '0' if no such column	/// @return item from @a column. '0' if no such column
const String* item(const String& column) {	const String* item(const String& column) {
int index=column_name2index(column, false);	int index=column_name2index(column, false);
Line 79 public:	Line 78 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;
	Temp_current tc(*this);
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);
	}
	}
	}

	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();	Temp_current tc(*this);
	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 112 public:	Line 119 public:
return true;	return true;
}	}
}	}
set_current(saved_current);

return false;	return false;
}	}
Line 122 public:	Line 128 public:

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

	/// Auto-object that temporarily saves and restores current
	class Temp_current {
	Table& ftable;
	size_t fcurrent;
	public:
	Temp_current(Table& atable) : ftable(atable), fcurrent(atable.current()){}
	~Temp_current(){
	ftable.set_current(fcurrent);
	}
};	};

#endif	#endif

E-mail:

Removed from v.1.48.2.11.2.9
changed lines
	Added in v.1.75