#include <result.hxx>
Inheritance diagram for pqxx::result::const_reverse_iterator:
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Reimplemented from pqxx::result::const_iterator. |
|
|
|
Reimplemented from pqxx::result::const_iterator. |
|
Reimplemented from pqxx::result::const_iterator. |
|
Reimplemented from pqxx::result::const_iterator. |
|
Reimplemented from pqxx::result::const_iterator. |
|
|
|
|
|
Reimplemented from pqxx::result::const_iterator. |
|
Reimplemented from pqxx::result::const_iterator. |
|
Reimplemented from pqxx::result::const_iterator. |
|
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. Reimplemented from pqxx::result::const_iterator. |
|
|
|
|
|
|
|
|
|
|
|
|