#include <p_edges.hh>
Inherits site_set_base_< F::result, p_edges< G, F > >.
Public Types | |
typedef util::edge< G > | edge |
Type of graph edge. | |
typedef F | fun_t |
Function associated type. | |
typedef util::edge< G > | graph_element |
Type of graph element this site set focuses on. | |
typedef G | graph_t |
Graph associated type. | |
typedef p_graph_piter< self_, mln_edge_bkd_iter(G) > | bkd_piter |
Backward Site_Iterator associated type. | |
typedef super_::site | element |
Associated types. | |
typedef p_graph_piter< self_, mln_edge_fwd_iter(G) > | fwd_piter |
Forward Site_Iterator associated type. | |
typedef fwd_piter | piter |
Site_Iterator associated type. | |
typedef p_edges_psite< G, F > | psite |
Point_Site associated type. | |
Public Member Functions | |
template<typename G2 > | |
bool | has (const util::edge< G2 > &e) const |
Does this site set has edge e? | |
bool | has (const psite &p) const |
Does this site set has site p? | |
void | invalidate () |
Invalidate this site set. | |
bool | is_valid () const |
Is this site set valid? | |
std::size_t | 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 | nedges () const |
Return The number of edges in the graph. | |
unsigned | nsites () const |
Return The number of points (sites) of the set, i.e., the number of edges. | |
const F & | function () const |
Return the mapping function. | |
const G & | graph () const |
Accessors. | |
template<typename F2 > | |
p_edges (const Graph< G > &gr, const Function< F2 > &f) | |
Construct a graph edge psite set from a graph and a function. | |
p_edges (const Graph< G > &gr, const Function< F > &f) | |
Construct a graph edge psite set from a graph and a function. | |
p_edges (const Graph< G > &gr) | |
Construct a graph edge psite set from a graph. | |
p_edges () | |
Constructors |
typedef p_graph_piter< self_, mln_edge_bkd_iter(G) > mln::p_edges< G, F >::bkd_piter |
Backward Site_Iterator associated type.
typedef util::edge<G> mln::p_edges< G, F >::edge |
Type of graph edge.
typedef super_ ::site mln::p_edges< G, F >::element |
Associated types.
Element associated type.
typedef F mln::p_edges< G, F >::fun_t |
Function associated type.
typedef p_graph_piter< self_, mln_edge_fwd_iter(G) > mln::p_edges< G, F >::fwd_piter |
Forward Site_Iterator associated type.
typedef util::edge<G> mln::p_edges< G, F >::graph_element |
typedef G mln::p_edges< G, F >::graph_t |
Graph associated type.
typedef fwd_piter mln::p_edges< G, F >::piter |
Site_Iterator associated type.
typedef p_edges_psite<G, F> mln::p_edges< G, F >::psite |
Point_Site associated type.
mln::p_edges< G, F >::p_edges | ( | ) | [inline] |
Constructors
Default constructor.
mln::p_edges< G, F >::p_edges | ( | const Graph< G > & | gr | ) | [inline] |
mln::p_edges< G, F >::p_edges | ( | const Graph< G > & | gr, | |
const Function< F > & | f | |||
) | [inline] |
mln::p_edges< G, F >::p_edges | ( | const Graph< G > & | gr, | |
const Function< F2 > & | f | |||
) | [inline] |
const F & mln::p_edges< G, F >::function | ( | ) | const [inline] |
Return the mapping function.
const G & mln::p_edges< G, F >::graph | ( | ) | const [inline] |
Accessors.
Return the graph associated to this site set
References mln::p_edges< G, F >::is_valid().
Referenced by mln::operator==().
bool mln::p_edges< G, F >::has | ( | const util::edge< G2 > & | e | ) | const [inline] |
Does this site set has edge e?
References mln::util::edge< G >::graph(), mln::util::edge< G >::is_valid(), and mln::p_edges< G, F >::is_valid().
bool mln::p_edges< G, F >::has | ( | const psite & | p | ) | const [inline] |
void mln::p_edges< G, F >::invalidate | ( | ) | [inline] |
Invalidate this site set.
bool mln::p_edges< G, F >::is_valid | ( | ) | const [inline] |
Is this site set valid?
Referenced by mln::p_edges< G, F >::graph(), mln::p_edges< G, F >::has(), and mln::p_edges< G, F >::p_edges().
std::size_t mln::p_edges< G, F >::memory_size | ( | ) | const [inline] |
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 [inline] |
unsigned mln::p_edges< G, F >::nsites | ( | ) | const [inline] |
Return The number of points (sites) of the set, i.e., the number of edges.
References mln::p_edges< G, F >::nedges().