#include <graph_iter_base.hh>
Public Types | |
| typedef Proxy< void > | category |
| typedef E | exact_t |
Public Member Functions | |
| const Elt & | p_hook_ () const |
| Return the element pointed by this iterator. | |
| const Elt & | subj_ () |
| Proxy subject. | |
| bool | is_valid () const |
| Iterator interfaceTest if the iterator is valid. | |
| void | invalidate () |
| Invalidate the iterator. | |
| void | start () |
| Start an iteration. | |
| void | next () |
| Go to the next value. | |
| Elt::id_t | id () const |
| Return the element id. | |
| operator typename Elt::id_t () const | |
| Conversion operator. Returns the element id. | |
| operator typename Elt::id_value_t () const | |
| Conversion operator. | |
| operator const Elt & () const | |
| Conversion operator. Returns the graph element. | |
Protected Member Functions | |
| graph_iter_base (const G &g) | |
Protected Attributes | |
| Elt | p_ |
Detailed Description
template<typename G, typename Elt, typename E>
class mln::internal::graph_iter_base< G, Elt, E >
Definition at line 47 of file graph_iter_base.hh.
Member Typedef Documentation
typedef Proxy<void> mln::Proxy< E >::category [inherited] |
Reimplemented from mln::Object< E >.
Reimplemented in mln::Accumulator< E >, mln::Pseudo_Site< E >, mln::Site_Proxy< E >, mln::Accumulator< sum< typename mln::value::props< T >::sum, S > >, mln::Accumulator< mean< T, S, M > >, mln::Accumulator< max_site< I > >, mln::Accumulator< val< A > >, mln::Accumulator< p< A > >, mln::Accumulator< histo< value::set< T > > >, mln::Accumulator< pair< A1, A2, T > >, mln::Accumulator< histo< S > >, mln::Accumulator< bbox< typename S::site > >, mln::Accumulator< sup< T > >, mln::Accumulator< histo< T > >, mln::Accumulator< var< T > >, mln::Accumulator< card< I > >, mln::Accumulator< bbox< typename Sc::site > >, mln::Accumulator< max_h< V > >, mln::Accumulator< count< T > >, mln::Accumulator< rank< T > >, mln::Accumulator< count_labels< L > >, mln::Accumulator< min< V > >, mln::Accumulator< height< I > >, mln::Accumulator< histo3d_rgb< V > >, mln::Accumulator< bbox< P > >, mln::Accumulator< lor >, mln::Accumulator< min_h< V > >, mln::Accumulator< histo< V > >, mln::Accumulator< median_alt< value::set< T > > >, mln::Accumulator< median_h< V > >, mln::Accumulator< min< T > >, mln::Accumulator< median_alt< S > >, mln::Accumulator< inf< T > >, mln::Accumulator< histo< typename I::value > >, mln::Accumulator< rank_high_quant< T > >, mln::Accumulator< count< P > >, mln::Accumulator< rank< bool > >, mln::Accumulator< center< P, V > >, mln::Accumulator< sum< T, S > >, mln::Accumulator< maj_h< T > >, mln::Accumulator< median_h< typename I::value > >, mln::Accumulator< count_adjacent_vertices< F, S > >, mln::Accumulator< rms< T, V > >, mln::Accumulator< sum< I, S > >, mln::Accumulator< tuple< A, n, BOOST_PP_ENUM_PARAMS(10, T)> >, mln::Accumulator< nil< T > >, mln::Accumulator< max< V > >, mln::Accumulator< volume< I > >, mln::Accumulator< lor_basic >, mln::Accumulator< variance< T, S, R > >, mln::Accumulator< sharpness< I > >, mln::Accumulator< count_value< V > >, mln::Accumulator< land_basic >, mln::Accumulator< count_adjacent_vertices< I > >, mln::Accumulator< land >, mln::Accumulator< convolve< T1, T2, R > >, mln::Accumulator< rectangularity< P > >, mln::Accumulator< label_used< L > >, mln::Accumulator< pair< min< V >, max< V >, mln_argument(min< V >) > >, mln::Accumulator< max< T > >, mln::Accumulator< deviation< T, S, M > >, mln::Pseudo_Site< complex_psite< D, G > >, mln::Pseudo_Site< p_edges_psite< G, F > >, mln::Pseudo_Site< p_indexed_psite< S > >, mln::Pseudo_Site< p_double_psite< S, Sp > >, mln::Pseudo_Site< faces_psite< N, D, P > >, mln::Pseudo_Site< p_run_psite< P > >, mln::Pseudo_Site< p_vertices_psite< G, F > >, mln::Site_Proxy< p_complex_faces_fwd_piter_< N, D, P > >, mln::Site_Proxy< up_node_piter< T > >, mln::Site_Proxy< p_faces_bkd_piter_< N, D, P > >, mln::Site_Proxy< neighb_bkd_niter< W > >, mln::Site_Proxy< complex_psite< D, G > >, mln::Site_Proxy< p_edges_psite< G, F > >, mln::Site_Proxy< box_runend_piter< P > >, mln::Site_Proxy< dn_leaf_piter< T > >, mln::Site_Proxy< p_run_bkd_piter_< P > >, mln::Site_Proxy< p_run_fwd_piter_< P > >, mln::Site_Proxy< p_indexed_psite< S > >, mln::Site_Proxy< dn_site_piter< T > >, mln::Site_Proxy< graph_window_if_piter< S, W, I > >, mln::Site_Proxy< p_indexed_fwd_piter< S > >, mln::Site_Proxy< p_transformed_piter< Pi, S, F > >, mln::Site_Proxy< multiple_size_qiter< n, W, F > >, mln::Site_Proxy< p_complex_faces_bkd_piter_< N, D, P > >, mln::Site_Proxy< p_double_psite< S, Sp > >, mln::Site_Proxy< graph_window_piter< S, W, I > >, mln::Site_Proxy< faces_psite< N, D, P > >, mln::Site_Proxy< p_faces_fwd_piter_< N, D, P > >, mln::Site_Proxy< p_graph_piter< S, I > >, mln::Site_Proxy< box_runstart_piter< P > >, mln::Site_Proxy< depth1st_piter< T > >, mln::Site_Proxy< p_run_psite< P > >, mln::Site_Proxy< neighb_fwd_niter< W > >, mln::Site_Proxy< dn_node_piter< T > >, mln::Site_Proxy< p_complex_fwd_piter_< D, G > >, mln::Site_Proxy< up_site_piter< T > >, mln::Site_Proxy< complex_window_fwd_piter< I, G, W > >, mln::Site_Proxy< p_centered_piter< W > >, mln::Site_Proxy< p_complex_bkd_piter_< D, G > >, mln::Site_Proxy< box_bkd_piter_< P > >, mln::Site_Proxy< complex_window_bkd_piter< I, G, W > >, mln::Site_Proxy< box_fwd_piter_< P > >, mln::Site_Proxy< complex_neighborhood_fwd_piter< I, G, N > >, mln::Site_Proxy< p_n_faces_bkd_piter< D, G > >, mln::Site_Proxy< p_n_faces_fwd_piter< D, G > >, mln::Site_Proxy< multiple_qiter< W, F > >, mln::Site_Proxy< complex_neighborhood_bkd_piter< I, G, N > >, mln::Site_Proxy< p_indexed_bkd_piter< S > >, mln::Site_Proxy< dpsites_bkd_piter< V > >, mln::Site_Proxy< p_double_piter< S, I1, I2 > >, mln::Site_Proxy< hexa_fwd_piter_< S > >, mln::Site_Proxy< up_leaf_piter< T > >, mln::Site_Proxy< dpsites_fwd_piter< V > >, mln::Site_Proxy< p_vertices_psite< G, F > >, and mln::Site_Proxy< p_if_piter_< Pi, S, F > >.
Definition at line 234 of file core/concept/proxy.hh.
typedef E mln::Object< E >::exact_t [inherited] |
Constructor & Destructor Documentation
| mln::internal::graph_iter_base< G, Elt, E >::graph_iter_base | ( | const G & | g | ) | [inline, protected] |
Definition at line 97 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::invalidate().
Member Function Documentation
| Elt::id_t mln::internal::graph_iter_base< G, Elt, E >::id | ( | ) | const [inline] |
Return the element id.
Definition at line 140 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
| void mln::internal::graph_iter_base< G, Elt, E >::invalidate | ( | ) | [inline] |
Invalidate the iterator.
Definition at line 114 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::is_valid(), and mln::internal::graph_iter_base< G, Elt, E >::p_.
Referenced by mln::internal::graph_iter_base< G, Elt, E >::graph_iter_base().
| bool mln::internal::graph_iter_base< G, Elt, E >::is_valid | ( | ) | const [inline] |
Iterator interfaceTest if the iterator is valid.
Definition at line 106 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
Referenced by mln::internal::graph_iter_base< G, Elt, E >::invalidate(), and mln::internal::graph_iter_base< G, Elt, E >::next().
| void mln::internal::graph_iter_base< G, Elt, E >::next | ( | ) | [inline] |
Go to the next value.
Definition at line 131 of file graph_iter_base.hh.
References mln::exact(), mln::internal::graph_iter_base< G, Elt, E >::is_valid(), and mln::internal::graph_iter_base< G, Elt, E >::p_.
| mln::internal::graph_iter_base< G, Elt, E >::operator const Elt & | ( | ) | const [inline] |
Conversion operator. Returns the graph element.
Definition at line 161 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
| mln::internal::graph_iter_base< G, Elt, E >::operator typename Elt::id_t | ( | ) | const [inline] |
Conversion operator. Returns the element id.
Definition at line 147 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
| mln::internal::graph_iter_base< G, Elt, E >::operator typename Elt::id_value_t | ( | ) | const [inline] |
Conversion operator.
Returns the element id. FIXME: May cause ambiguities.
Definition at line 154 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
| const Elt & mln::internal::graph_iter_base< G, Elt, E >::p_hook_ | ( | ) | const [inline] |
Return the element pointed by this iterator.
Definition at line 177 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
| void mln::internal::graph_iter_base< G, Elt, E >::start | ( | ) | [inline] |
Start an iteration.
Definition at line 123 of file graph_iter_base.hh.
References mln::exact(), and mln::internal::graph_iter_base< G, Elt, E >::p_.
| const Elt & mln::internal::graph_iter_base< G, Elt, E >::subj_ | ( | ) | [inline] |
Proxy subject.
Definition at line 169 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
Member Data Documentation
Elt mln::internal::graph_iter_base< G, Elt, E >::p_ [protected] |
Definition at line 88 of file graph_iter_base.hh.
Referenced by mln::internal::graph_iter_base< G, Elt, E >::id(), mln::internal::graph_iter_base< G, Elt, E >::invalidate(), mln::internal::graph_iter_base< G, Elt, E >::is_valid(), mln::internal::graph_iter_base< G, Elt, E >::next(), mln::internal::edge_bkd_iterator< G >::next_id_(), mln::internal::edge_fwd_iterator< G >::next_id_(), mln::internal::vertex_bkd_iterator< G >::next_id_(), mln::internal::vertex_fwd_iterator< G >::next_id_(), mln::internal::graph_iter_base< G, Elt, E >::operator const Elt &(), mln::internal::graph_iter_base< G, Elt, E >::operator typename Elt::id_t(), mln::internal::graph_iter_base< G, Elt, E >::operator typename Elt::id_value_t(), mln::internal::graph_iter_base< G, Elt, E >::p_hook_(), mln::internal::graph_iter_base< G, Elt, E >::start(), mln::internal::edge_bkd_iterator< G >::start_id_(), mln::internal::vertex_bkd_iterator< G >::start_id_(), and mln::internal::graph_iter_base< G, Elt, E >::subj_().
