|
| template<typename Iter > |
| | bidirectional_iter (const Iter &s) |
| |
| | bidirectional_iter (move_from< bidirectional_iter > x) |
| |
| void | decrement () |
| |
| R | dereference () const |
| |
| bool | equal (const bidirectional_iter &x) const |
| |
| void | increment () |
| |
| bidirectional_iter & | operator= (bidirectional_iter x) |
| |
| poly_base & | assign (const T &x) |
| |
| boost::enable_if< is_base_derived_or_same< any_bidirectional_iterator_interface< V, R, D >, J > >::type | assign (const poly_base< J, K > &x) |
| |
| const T & | cast () const |
| |
| T & | cast () |
| |
| bool | cast (T &x) const |
| |
| interface_type & | interface_ref () |
| |
| const interface_type & | interface_ref () const |
| |
| bool | is_dynamic_convertible_to () const |
| |
| const interface_type * | operator-> () const |
| |
| interface_type * | operator-> () |
| |
| poly_base & | operator= (poly_base x) |
| |
| | poly_base (T x, typename boost::disable_if< boost::is_base_of< poly_base, T > >::type *=0) |
| |
| | poly_base (const poly_base< J, K > &x, typename boost::enable_if< is_base_derived_or_same< any_bidirectional_iterator_interface< V, R, D >, J > >::type *dummy=0) |
| |
| | poly_base (const poly_base &x) |
| |
| | poly_base (move_from< poly_base > x) |
| |
| void * | storage () |
| |
| const void * | storage () const |
| |
| const std::type_info & | type_info () const |
| |
| | ~poly_base () |
| |
template<typename V, typename R = V&, typename D = std::ptrdiff_t>
struct adobe::bidirectional_iter< V, R, D >
Definition at line 184 of file any_iterator.hpp.