mln::internal::is_masked_impl_selector< p_edges< G1, F1 >, p_vertices< G2, F2 >, E > Struct Template Reference

Restrict iteration on edges according to masked vertices. More...

#include <is_masked_impl_selector.hh>

List of all members.

Public Types
typedef p_edges< G1, F1 >	S
Public Member Functions
bool	is_masked (const typename S::graph_element &center, const typename S::graph_element &element) const
	Return wheter a graph element must be masked by this window.

---

Detailed Description

template<typename G1, typename F1, typename G2, typename F2, typename E>
struct mln::internal::is_masked_impl_selector< p_edges< G1, F1 >, p_vertices< G2, F2 >, E >

Restrict iteration on edges according to masked vertices.

---

Member Typedef Documentation

template<typename G1 , typename F1 , typename G2 , typename F2 , typename E >

typedef p_edges<G1,F1> mln::internal::is_masked_impl_selector< p_edges< G1, F1 >, p_vertices< G2, F2 >, E >::S

---

Member Function Documentation

template<typename G1 , typename F1 , typename G2 , typename F2 , typename E >

bool mln::internal::is_masked_impl_selector< p_edges< G1, F1 >, p_vertices< G2, F2 >, E >::is_masked	(	const typename S::graph_element &	center,
		const typename S::graph_element &	element
	)			const [inline]

Return wheter a graph element must be masked by this window.

center element X -------- X ------------ X

We try to find the common vertex. Then we test if the other one is masked or not.