Iterator for rows in a result. Use as result::const_iterator. More...
#include <result.hxx>
Iterator for rows in a result. Use as result::const_iterator.
A result, once obtained, cannot be modified. Therefore there is no plain iterator type for result. However its const_iterator type can be used to inspect its rows without changing them.
Reimplemented from pqxx::row.
typedef const row* pqxx::const_result_iterator::pointer |
Reimplemented from pqxx::row.
Reimplemented from pqxx::row.
Reimplemented from pqxx::row.
pqxx::const_result_iterator::const_result_iterator | ( | ) |
pqxx::const_result_iterator::const_result_iterator | ( | const row & | t | ) |
bool pqxx::const_result_iterator::operator!= | ( | const const_result_iterator & | i | ) | const |
Reimplemented from pqxx::row.
Reimplemented in pqxx::const_reverse_result_iterator.
reference pqxx::const_result_iterator::operator* | ( | ) | const |
const_result_iterator pqxx::const_result_iterator::operator+ | ( | difference_type | ) | const |
Reimplemented in pqxx::const_reverse_result_iterator.
const_result_iterator& pqxx::const_result_iterator::operator++ | ( | ) |
Reimplemented in pqxx::const_reverse_result_iterator.
Referenced by pqxx::const_reverse_result_iterator::operator--().
pqxx::const_result_iterator pqxx::const_result_iterator::operator++ | ( | int | ) |
Reimplemented in pqxx::const_reverse_result_iterator.
References pqxx::row::m_Index.
const_result_iterator& pqxx::const_result_iterator::operator+= | ( | difference_type | i | ) |
Reimplemented in pqxx::const_reverse_result_iterator.
result::difference_type pqxx::const_result_iterator::operator- | ( | const_result_iterator | i | ) | const |
References pqxx::row::num().
const_result_iterator pqxx::const_result_iterator::operator- | ( | difference_type | ) | const |
const_result_iterator& pqxx::const_result_iterator::operator-- | ( | ) |
Reimplemented in pqxx::const_reverse_result_iterator.
Referenced by pqxx::const_reverse_result_iterator::operator++().
pqxx::const_result_iterator pqxx::const_result_iterator::operator-- | ( | int | ) |
Reimplemented in pqxx::const_reverse_result_iterator.
References pqxx::row::m_Index.
const_result_iterator& pqxx::const_result_iterator::operator-= | ( | difference_type | i | ) |
Reimplemented in pqxx::const_reverse_result_iterator.
pointer pqxx::const_result_iterator::operator-> | ( | ) | const |
The iterator "points to" its own row, 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.
bool pqxx::const_result_iterator::operator< | ( | const const_result_iterator & | i | ) | const |
Reimplemented in pqxx::const_reverse_result_iterator.
bool pqxx::const_result_iterator::operator<= | ( | const const_result_iterator & | i | ) | const |
Reimplemented in pqxx::const_reverse_result_iterator.
bool pqxx::const_result_iterator::operator== | ( | const const_result_iterator & | i | ) | const |
Reimplemented from pqxx::row.
Reimplemented in pqxx::const_reverse_result_iterator.
bool pqxx::const_result_iterator::operator> | ( | const const_result_iterator & | i | ) | const |
Reimplemented in pqxx::const_reverse_result_iterator.
bool pqxx::const_result_iterator::operator>= | ( | const const_result_iterator & | i | ) | const |
Reimplemented in pqxx::const_reverse_result_iterator.
const_result_iterator operator+ | ( | difference_type | , | |
const_result_iterator | ||||
) | [friend] |
friend class pqxx::result [friend] |