#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[2]. Reimplemented from pqxx::result::const_iterator. |
|
|
|
|
|
|
|
|
|
|