Reverse iterator for result. Use as result::const_reverse_iterator. More...
#include <result.hxx>
Public Types | |
typedef result::difference_type | difference_type |
typedef const_result_iterator | iterator_type |
typedef const tuple * | pointer |
typedef tuple | reference |
typedef const_result_iterator | super |
Private Types | |
typedef const_tuple_iterator | const_iterator |
typedef const_reverse_tuple_iterator | const_reverse_iterator |
typedef const_iterator | iterator |
typedef const_reverse_iterator | reverse_iterator |
typedef result::size_type | size_type |
Private Member Functions | |
const_iterator | begin () const throw () |
bool PQXX_PURE | empty () const throw () |
const_iterator | end () const throw () |
size_t | num () const |
size_t | rownumber () const throw () |
size_type | size () const throw () |
tuple | slice (size_type Begin, size_type End) const |
Produce a slice of this tuple, containing the given range of columns. More... | |
void | swap (tuple &) throw () |
Dereferencing operators | |
pointer | operator-> () const |
The iterator "points to" its own tuple, which is also itself. More... | |
reference | operator* () const |
Comparisons | |
bool | operator== (const const_result_iterator &i) const |
bool | operator!= (const const_result_iterator &i) const |
bool | operator< (const const_result_iterator &i) const |
bool | operator<= (const const_result_iterator &i) const |
bool | operator> (const const_result_iterator &i) const |
bool | operator>= (const const_result_iterator &i) const |
Comparison | |
bool PQXX_PURE | operator== (const tuple &) const throw () |
bool | operator!= (const tuple &rhs) const throw () |
Arithmetic operators | |
const_result_iterator | operator- (difference_type) const |
difference_type | operator- (const_result_iterator) const |
Field access | |
reference | front () const throw () |
reference | back () const throw () |
const_reverse_tuple_iterator | rbegin () const |
const_reverse_tuple_iterator | rend () const |
reference | operator[] (size_type) const throw () |
reference | operator[] (int) const throw () |
reference | operator[] (const char[]) const |
reference | operator[] (const PGSTD::string &) const |
reference | at (size_type) const throw (range_error) |
reference | at (int) const throw (range_error) |
reference | at (const char[]) const |
reference | at (const PGSTD::string &) const |
Column information | |
size_type | column_number (const PGSTD::string &ColName) const |
Number of given column (throws exception if it doesn't exist) More... | |
size_type | column_number (const char[]) const |
Number of given column (throws exception if it doesn't exist) More... | |
oid | column_type (size_type) const |
Type of given column. More... | |
oid | column_type (int ColNum) const |
Type of given column. More... | |
oid | column_type (const PGSTD::string &ColName) const |
Type of given column. More... | |
oid | column_type (const char ColName[]) const |
Type of given column. More... | |
oid | column_table (size_type ColNum) const |
What table did this column come from? More... | |
oid | column_table (int ColNum) const |
What table did this column come from? More... | |
oid | column_table (const PGSTD::string &ColName) const |
What table did this column come from? More... | |
size_type | table_column (size_type) const |
What column number in its table did this result column come from? More... | |
size_type | table_column (int ColNum) const |
What column number in its table did this result column come from? More... | |
size_type | table_column (const PGSTD::string &ColName) const |
What column number in its table did this result column come from? More... | |
Private Attributes | |
size_type | m_Begin |
size_type | m_End |
const result * | m_Home |
size_t | m_Index |
Reverse iterator for result. Use as result::const_reverse_iterator.
|
inherited |
|
inherited |
|
inherited |
typedef const tuple* pqxx::const_result_iterator::pointer |
|
inherited |
|
inherited |
|
inline |
|
inlineexplicit |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
const_result_iterator PQXX_PURE pqxx::const_reverse_result_iterator::base | ( | ) | const throw () |
|
inherited |
|
inlineinherited |
Number of given column (throws exception if it doesn't exist)
References pqxx::tuple::column_number().
Referenced by pqxx::tuple::column_number().
|
inherited |
Number of given column (throws exception if it doesn't exist)
What table did this column come from?
|
inlineinherited |
What table did this column come from?
References pqxx::tuple::column_table().
Referenced by pqxx::tuple::column_table().
|
inlineinherited |
What table did this column come from?
References pqxx::tuple::column_table().
Referenced by pqxx::tuple::column_table().
|
inlineinherited |
Type of given column.
References pqxx::tuple::column_type().
Referenced by pqxx::tuple::column_type().
|
inlineinherited |
Type of given column.
References pqxx::tuple::column_type().
Referenced by pqxx::tuple::column_type().
|
inlineinherited |
Type of given column.
References pqxx::tuple::column_type().
Referenced by pqxx::tuple::column_type().
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
|
inlineinherited |
|
inline |
|
inlineinherited |
|
inline |
|
inline |
const_reverse_result_iterator pqxx::const_reverse_result_iterator::operator++ | ( | int | ) |
|
inline |
|
inlineinherited |
|
inlineinherited |
|
inline |
|
inline |
|
inline |
const_reverse_result_iterator pqxx::const_reverse_result_iterator::operator-- | ( | int | ) |
|
inline |
|
inlineinherited |
The iterator "points to" its own tuple, which is also itself.
This allows a result to be addressed as a two-dimensional container without going through the intermediate step of dereferencing the iterator. I hope this works out to be similar to C pointer/array semantics in useful cases.
IIRC Alex Stepanov, the inventor of the STL, once remarked that having this as standard behaviour for pointers would be useful in some algorithms. So even if this makes me look foolish, I would seem to be in distinguished company.
|
inlineinherited |
|
inline |
|
inlineinherited |
|
inline |
|
inline |
|
inlineinherited |
|
inline |
|
inlineinherited |
|
inline |
|
inlineinherited |
|
inline |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inherited |
|
inlineinherited |
|
inlineinherited |
Produce a slice of this tuple, containing the given range of columns.
The slice runs from the range's starting column to the range's end column, exclusive. It looks just like a normal result tuple, except slices can be empty.
|
inherited |
What column number in its table did this result column come from?
A meaningful answer can be given only if the column in question comes directly from a column in a table. If the column is computed in any other way, a logic_error will be thrown.
ColNum | a zero-based column number in this result set |
Requires libpq from PostgreSQL 7.4 or better, as well as a server version of at least 7.4.
|
inlineinherited |
What column number in its table did this result column come from?
References pqxx::tuple::table_column().
Referenced by pqxx::tuple::table_column().
|
inlineinherited |
What column number in its table did this result column come from?
References pqxx::tuple::table_column().
Referenced by pqxx::tuple::table_column().
|
protectedinherited |
|
protectedinherited |
|
protectedinherited |
|
protectedinherited |