$extrastylesheet
#include <mln/core/site_set/p_edges.hh>
Public Member Functions | |
| bool | has (const psite &p) const |
| template<typename G2 > | |
| bool | has (const util::edge< G2 > &e) const |
| void | invalidate () |
| bool | is_empty () const |
| bool | is_valid () const |
| std::size_t | memory_size () const |
| unsigned | nedges () const |
| unsigned | nsites () const |
Constructors. | |
| p_edges () | |
| p_edges (const Graph< G > &gr) | |
| p_edges (const Graph< G > &gr, const Function< F > &f) | |
| template<typename F2 > | |
| p_edges (const Graph< G > &gr, const Function< F2 > &f) | |
Accessors. | |
| const G & | graph () const |
| const F & | function () const |
Public Types | |
| typedef Site_Set< void > | category |
| typedef util::edge< G > | edge |
| typedef p_edges< G, F > | exact_t |
| typedef F | fun_t |
| typedef util::edge< G > | graph_element |
| typedef G | graph_t |
| typedef subject< F::result >::ret | site |
Associated types. | |
| typedef super_::site | element |
| typedef p_edges_psite< G, F > | psite |
| typedef p_graph_piter< self_, mln_edge_fwd_iter(G) > | fwd_piter |
| typedef p_graph_piter< self_, mln_edge_bkd_iter(G) > | bkd_piter |
| typedef fwd_piter | piter |
Site set mapping graph edges and image sites.
Definition at line 71 of file p_edges.hh.
| mln::p_edges< G, F >::p_edges | ( | ) |
Default constructor.
| mln::p_edges< G, F >::p_edges | ( | const Graph< G > & | gr | ) |
Construct a graph edge psite set from a graph.
| gr | The graph upon which the graph edge psite set is built. |
| mln::p_edges< G, F >::p_edges | ( | const Graph< G > & | gr, |
| const Function< F > & | f | ||
| ) |
Construct a graph edge psite set from a graph and a function.
| gr | The graph upon which the graph edge psite set is built. |
| f | the function mapping edges and sites. |
| mln::p_edges< G, F >::p_edges | ( | const Graph< G > & | gr, |
| const Function< F2 > & | f | ||
| ) |
Construct a graph edge psite set from a graph and a function.
| gr | The graph upon which the graph edge psite set is built. |
| f | the function mapping edges and sites. It must be convertible towards the function type F. |
| const F& mln::p_edges< G, F >::function | ( | ) | const |
Return the mapping function.
| const G& mln::p_edges< G, F >::graph | ( | ) | const |
Return the graph associated to this site set.
| bool mln::p_edges< G, F >::has | ( | const psite & | p | ) | const |
Does this site set has site p?
| bool mln::p_edges< G, F >::has | ( | const util::edge< G2 > & | e | ) | const |
Does this site set has edge e?
| void mln::p_edges< G, F >::invalidate | ( | ) |
Invalidate this site set.
|
inherited |
Test if the site set is empty.
This final method dispatches to is_empty_ whose default implementation relies on the 'nsites' method.
| bool mln::p_edges< G, F >::is_valid | ( | ) | const |
Is this site set valid?
| std::size_t mln::p_edges< G, F >::memory_size | ( | ) | const |
Does this site set has vertex_id? FIXME: causes ambiguities while calling has(mln::neighb_fwd_niter<>); bool has(unsigned vertex_id) const;.
| unsigned mln::p_edges< G, F >::nedges | ( | ) | const |
Return The number of edges in the graph.
| unsigned mln::p_edges< G, F >::nsites | ( | ) | const |
Return The number of points (sites) of the set, i.e., the number of edges.
| typedef p_graph_piter< self_, mln_edge_bkd_iter(G) > mln::p_edges< G, F >::bkd_piter |
Backward Site_Iterator associated type.
Definition at line 132 of file p_edges.hh.
|
inherited |
Definition at line 74 of file core/concept/site_set.hh.
| typedef util::edge<G> mln::p_edges< G, F >::edge |
Type of graph edge.
Definition at line 87 of file p_edges.hh.
| typedef super_ ::site mln::p_edges< G, F >::element |
Element associated type.
Definition at line 123 of file p_edges.hh.
|
inherited |
| typedef F mln::p_edges< G, F >::fun_t |
Function associated type.
Definition at line 84 of file p_edges.hh.
| typedef p_graph_piter< self_, mln_edge_fwd_iter(G) > mln::p_edges< G, F >::fwd_piter |
Forward Site_Iterator associated type.
Definition at line 129 of file p_edges.hh.
| typedef util::edge<G> mln::p_edges< G, F >::graph_element |
Type of graph element this site set focuses on.
Definition at line 90 of file p_edges.hh.
| typedef G mln::p_edges< G, F >::graph_t |
Graph associated type.
Definition at line 81 of file p_edges.hh.
| typedef fwd_piter mln::p_edges< G, F >::piter |
Site_Iterator associated type.
Definition at line 135 of file p_edges.hh.
| typedef p_edges_psite<G, F> mln::p_edges< G, F >::psite |
Point_Site associated type.
Definition at line 126 of file p_edges.hh.
|
inherited |
Site associated type.
Definition at line 58 of file site_set_base.hh.