mln::internal::edge_fwd_iterator< G > Class Template Reference
Forward edge iterator. More...
#include <graph_iter.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. | |
| edge_fwd_iterator (const G &g) | |
| edge_fwd_iterator () | |
| Constructors. | |
| Elt::id_t | id () const |
| Return the element id. | |
| void | invalidate () |
| Invalidate the iterator. | |
| bool | is_valid () const |
| Iterator interface | |
| void | next () |
| Go to the next value. | |
| operator const Elt & () const | |
| Conversion operator. Returns the graph element. | |
| operator typename Elt::id_t () const | |
| Conversion operator. Returns the element id. | |
| operator typename Elt::id_value_t () const | |
| Conversion operator. | |
| void | start () |
| Start an iteration. | |
Protected Member Functions | |
| util::edge_id_t | next_id_ () const |
| Returns the next element id. | |
| util::edge_id_t | start_id_ () const |
| Returns the id of the first element. | |
Protected Attributes | |
| Elt | p_ |
Private Types | |
| typedef graph_iter_base< G, util::edge< G > , edge_fwd_iterator< G > > | super_ |
Friends | |
| class | graph_iter_base< G, util::edge< G >, edge_fwd_iterator< G > > |
Detailed Description
template<typename G>
class mln::internal::edge_fwd_iterator< G >
Forward edge iterator.
Definition at line 104 of file graph_iter.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< mln::accu::maj_h< T > >, mln::Accumulator< mln::accu::stat::variance< T, S, R > >, mln::Accumulator< mln::accu::shape::bbox< Sc::site > >, mln::Accumulator< mln::accu::math::sum< T, S > >, mln::Accumulator< mln::accu::shape::bbox< S::site > >, mln::Accumulator< mln::accu::logic::lor >, mln::Accumulator< mln::accu::stat::min_h< V > >, mln::Accumulator< mln::accu::stat::median_alt< mln::value::set< T > > >, mln::Accumulator< mln::accu::stat::rank_high_quant< T > >, mln::Accumulator< mln::accu::pair< mln::accu::stat::min< V >, mln::accu::stat::max< V >, mln_argument(mln::accu::stat::min< V >) > >, mln::Accumulator< mln::accu::math::sup< T > >, mln::Accumulator< mln::accu::math::inf< T > >, mln::Accumulator< mln::accu::shape::bbox< P > >, mln::Accumulator< mln::accu::count_labels< L > >, mln::Accumulator< mln::accu::math::count< P > >, mln::Accumulator< mln::accu::center< P, V > >, mln::Accumulator< mln::accu::stat::mean< T, S, M > >, mln::Accumulator< mln::accu::convolve< T1, T2, R > >, mln::Accumulator< mln::accu::logic::lor_basic >, mln::Accumulator< mln::accu::count_adjacent_vertices< F, S > >, mln::Accumulator< mln::accu::shape::height< I > >, mln::Accumulator< mln::accu::stat::rank< T > >, mln::Accumulator< mln::accu::rms< T, V > >, mln::Accumulator< mln::accu::math::count< T > >, mln::Accumulator< mln::accu::count_value< V > >, mln::Accumulator< mln::accu::logic::land_basic >, mln::Accumulator< mln::morpho::attribute::count_adjacent_vertices< I > >, mln::Accumulator< mln::accu::stat::deviation< T, S, M > >, mln::Accumulator< mln::morpho::attribute::sharpness< I > >, mln::Accumulator< mln::accu::histo< V > >, mln::Accumulator< mln::accu::stat::max_h< V > >, mln::Accumulator< mln::accu::stat::max< T > >, mln::Accumulator< mln::accu::stat::min< T > >, mln::Accumulator< mln::accu::p< A > >, mln::Accumulator< mln::accu::shape::volume< I > >, mln::Accumulator< mln::accu::histo< S > >, mln::Accumulator< mln::accu::histo< mln::value::set< T > > >, mln::Accumulator< mln::accu::logic::land >, mln::Accumulator< mln::accu::max_site< I > >, mln::Accumulator< mln::accu::stat::rank< bool > >, mln::Accumulator< mln::accu::tuple< A, n, BOOST_PP_ENUM_PARAMS(10, T)> >, mln::Accumulator< mln::accu::stat::max< V > >, mln::Accumulator< mln::accu::stat::min< V > >, mln::Accumulator< mln::accu::nil< T > >, mln::Accumulator< mln::accu::stat::var< T > >, mln::Accumulator< mln::accu::stat::median_h< V > >, mln::Accumulator< mln::morpho::attribute::height< I > >, mln::Accumulator< mln::morpho::attribute::sum< I, S > >, mln::Accumulator< mln::morpho::attribute::card< I > >, mln::Accumulator< mln::accu::histo< I::value > >, mln::Accumulator< mln::accu::stat::median_h< I::value > >, mln::Accumulator< mln::accu::site_set::rectangularity< P > >, mln::Accumulator< mln::accu::val< A > >, mln::Accumulator< mln::morpho::attribute::volume< I > >, mln::Accumulator< mln::accu::histo< T > >, mln::Accumulator< mln::accu::stat::median_alt< S > >, mln::Accumulator< mln::accu::label_used< L > >, mln::Accumulator< mln::accu::pair< A1, A2, T > >, mln::Pseudo_Site< mln::p_run_psite< P > >, mln::Pseudo_Site< mln::p_indexed_psite< S > >, mln::Pseudo_Site< mln::p_vertices_psite< G, F > >, mln::Pseudo_Site< mln::faces_psite< N, D, P > >, mln::Pseudo_Site< mln::complex_psite< D, G > >, mln::Pseudo_Site< mln::p_double_psite< S, Sp > >, mln::Pseudo_Site< mln::p_edges_psite< G, F > >, mln::Site_Proxy< mln::p_indexed_fwd_piter< S > >, mln::Site_Proxy< mln::p_graph_piter< S, I > >, mln::Site_Proxy< mln::win::multiple_size_qiter< n, W, F > >, mln::Site_Proxy< mln::p_run_bkd_piter_< P > >, mln::Site_Proxy< mln::p_run_psite< P > >, mln::Site_Proxy< mln::p_complex_fwd_piter_< D, G > >, mln::Site_Proxy< mln::p_transformed_piter< Pi, S, F > >, mln::Site_Proxy< mln::p_faces_bkd_piter_< N, D, P > >, mln::Site_Proxy< mln::win::multiple_qiter< W, F > >, mln::Site_Proxy< mln::p_indexed_psite< S > >, mln::Site_Proxy< mln::box_fwd_piter_< P > >, mln::Site_Proxy< mln::morpho::tree::dn_site_piter< T > >, mln::Site_Proxy< mln::p_complex_bkd_piter_< D, G > >, mln::Site_Proxy< mln::p_indexed_bkd_piter< S > >, mln::Site_Proxy< mln::morpho::tree::up_site_piter< T > >, mln::Site_Proxy< mln::p_n_faces_bkd_piter< D, P > >, mln::Site_Proxy< mln::graph_window_piter< S, W, I > >, mln::Site_Proxy< mln::box_bkd_piter_< P > >, mln::Site_Proxy< mln::dpsites_bkd_piter< V > >, mln::Site_Proxy< mln::morpho::tree::dn_node_piter< T > >, mln::Site_Proxy< mln::p_complex_faces_bkd_piter_< N, D, P > >, mln::Site_Proxy< mln::complex_window_fwd_piter< I, G, W > >, mln::Site_Proxy< mln::morpho::tree::up_node_piter< T > >, mln::Site_Proxy< mln::morpho::tree::up_leaf_piter< T > >, mln::Site_Proxy< mln::p_vertices_psite< G, F > >, mln::Site_Proxy< mln::box_runstart_piter< P > >, mln::Site_Proxy< mln::complex_window_bkd_piter< I, G, W > >, mln::Site_Proxy< mln::faces_psite< N, D, P > >, mln::Site_Proxy< mln::p_faces_fwd_piter_< N, D, P > >, mln::Site_Proxy< mln::morpho::tree::depth1st_piter< T > >, mln::Site_Proxy< mln::box_runend_piter< P > >, mln::Site_Proxy< mln::dpsites_fwd_piter< V > >, mln::Site_Proxy< mln::complex_neighborhood_bkd_piter< I, G, N > >, mln::Site_Proxy< mln::p_if_piter_< Pi, S, F > >, mln::Site_Proxy< mln::complex_psite< D, G > >, mln::Site_Proxy< mln::p_centered_piter< W > >, mln::Site_Proxy< mln::neighb_bkd_niter< W > >, mln::Site_Proxy< mln::p_double_psite< S, Sp > >, mln::Site_Proxy< mln::graph_window_if_piter< S, W, I > >, mln::Site_Proxy< mln::hexa_fwd_piter_< S > >, mln::Site_Proxy< mln::p_complex_faces_fwd_piter_< N, D, P > >, mln::Site_Proxy< mln::neighb_fwd_niter< W > >, mln::Site_Proxy< mln::p_n_faces_fwd_piter< D, P > >, mln::Site_Proxy< mln::morpho::tree::dn_leaf_piter< T > >, mln::Site_Proxy< mln::p_run_fwd_piter_< P > >, mln::Site_Proxy< mln::p_double_piter< S, I1, I2 > >, mln::Site_Proxy< mln::p_edges_psite< G, F > >, and mln::Site_Proxy< mln::complex_neighborhood_fwd_piter< I, G, N > >.
Definition at line 234 of file core/concept/proxy.hh.
typedef E mln::Object< E >::exact_t [inherited] |
typedef graph_iter_base<G, util::edge<G>, edge_fwd_iterator<G> > mln::internal::edge_fwd_iterator< G >::super_ [private] |
Definition at line 107 of file graph_iter.hh.
Constructor & Destructor Documentation
| mln::internal::edge_fwd_iterator< G >::edge_fwd_iterator | ( | ) | [inline] |
| mln::internal::edge_fwd_iterator< G >::edge_fwd_iterator | ( | const G & | g | ) | [inline] |
Definition at line 244 of file graph_iter.hh.
Member Function Documentation
| Elt::id_t mln::internal::graph_iter_base< G, Elt, E >::id | ( | ) | const [inline, inherited] |
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, inherited] |
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, inherited] |
Iterator interface
Test 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, inherited] |
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_.
| util::edge_id_t mln::internal::edge_fwd_iterator< G >::next_id_ | ( | ) | const [inline, protected] |
Returns the next element id.
Called in next();
Definition at line 260 of file graph_iter.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
| mln::internal::graph_iter_base< G, Elt, E >::operator const Elt & | ( | ) | const [inline, inherited] |
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, inherited] |
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, inherited] |
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, inherited] |
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, inherited] |
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_.
| util::edge_id_t mln::internal::edge_fwd_iterator< G >::start_id_ | ( | ) | const [inline, protected] |
Returns the id of the first element.
Called in start();
Definition at line 252 of file graph_iter.hh.
| const Elt & mln::internal::graph_iter_base< G, Elt, E >::subj_ | ( | ) | [inline, inherited] |
Definition at line 169 of file graph_iter_base.hh.
References mln::internal::graph_iter_base< G, Elt, E >::p_.
Friends And Related Function Documentation
friend class graph_iter_base< G, util::edge< G >, edge_fwd_iterator< G > > [friend] |
Definition at line 125 of file graph_iter.hh.
Member Data Documentation
Elt mln::internal::graph_iter_base< G, Elt, E >::p_ [protected, inherited] |
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_().
