Elementary window on graph class. More...
#include <graph_elt_mixed_window.hh>
Public Types | |
typedef Window< void > | category |
typedef graph_elt_mixed_window < G, S, S2 > | exact_t |
typedef super_::target | target |
Associated types. | |
typedef target::psite | psite |
The type of psite corresponding to the window. | |
typedef S::psite | center_t |
Type of the window center element. | |
typedef target::graph_element | graph_element |
Type of the graph element pointed by this iterator. | |
typedef graph_window_piter < target, self_, nbh_fwd_iter_ > | fwd_qiter |
Site_Iterator type to browse the psites of the window w.r.t. | |
typedef graph_window_piter < target, self_, nbh_bkd_iter_ > | bkd_qiter |
Site_Iterator type to browse the psites of the window w.r.t. | |
typedef fwd_qiter | qiter |
The default qiter type. | |
typedef S2::fun_t::result | site |
Associated types. | |
typedef void | dpsite |
Public Member Functions | |
bool | is_valid () const |
Return true by default. | |
bool | is_empty () const |
Interface of the concept Window. | |
bool | is_centered () const |
Is the window centered? | |
bool | is_symmetric () const |
Is the window symmetric? | |
unsigned | delta () const |
Return the maximum coordinate gap between the window center and a window point. | |
self_ & | sym () |
Apply a central symmetry to the target window. | |
bool | is_neighbable_ () const |
Is the window neighbable? | |
Private Types | |
typedef super_::nbh_bkd_iter_ | nbh_bkd_iter_ |
typedef super_::nbh_fwd_iter_ | nbh_fwd_iter_ |
typedef graph_elt_mixed_window < G, S, S2 > | self_ |
typedef internal::graph_mixed_window_iter_dispatch < G, S, S2 > | super_ |
Elementary window on graph class.
G
is the graph type. S
is an image site set from where the center is extracted. S2
is an image site set from where the neighbors are extracted.
Definition at line 109 of file graph_elt_mixed_window.hh.
typedef graph_window_piter<target,self_,nbh_bkd_iter_> mln::graph_elt_mixed_window< G, S, S2 >::bkd_qiter |
Site_Iterator type to browse the psites of the window w.r.t.
the reverse ordering of vertices.
Definition at line 139 of file graph_elt_mixed_window.hh.
typedef Window<void> mln::Window< graph_elt_mixed_window< G, S, S2 > >::category [inherited] |
Reimplemented from mln::Object< graph_elt_mixed_window< G, S, S2 > >.
Definition at line 89 of file concept/window.hh.
typedef S ::psite mln::graph_elt_mixed_window< G, S, S2 >::center_t |
Type of the window center element.
Definition at line 128 of file graph_elt_mixed_window.hh.
typedef void mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::dpsite [inherited] |
Definition at line 51 of file graph_window_base.hh.
typedef graph_elt_mixed_window< G, S, S2 > mln::Object< graph_elt_mixed_window< G, S, S2 > >::exact_t [inherited] |
typedef graph_window_piter<target,self_,nbh_fwd_iter_> mln::graph_elt_mixed_window< G, S, S2 >::fwd_qiter |
Site_Iterator type to browse the psites of the window w.r.t.
the ordering of vertices.
Definition at line 135 of file graph_elt_mixed_window.hh.
typedef target ::graph_element mln::graph_elt_mixed_window< G, S, S2 >::graph_element |
Type of the graph element pointed by this iterator.
Definition at line 131 of file graph_elt_mixed_window.hh.
typedef super_::nbh_bkd_iter_ mln::graph_elt_mixed_window< G, S, S2 >::nbh_bkd_iter_ [private] |
Definition at line 118 of file graph_elt_mixed_window.hh.
typedef super_::nbh_fwd_iter_ mln::graph_elt_mixed_window< G, S, S2 >::nbh_fwd_iter_ [private] |
Definition at line 117 of file graph_elt_mixed_window.hh.
typedef target ::psite mln::graph_elt_mixed_window< G, S, S2 >::psite |
The type of psite corresponding to the window.
Definition at line 125 of file graph_elt_mixed_window.hh.
typedef fwd_qiter mln::graph_elt_mixed_window< G, S, S2 >::qiter |
The default qiter type.
Definition at line 142 of file graph_elt_mixed_window.hh.
typedef graph_elt_mixed_window<G,S,S2> mln::graph_elt_mixed_window< G, S, S2 >::self_ [private] |
Reimplemented from mln::graph_window_base< S2::fun_t::result, graph_elt_mixed_window< G, S, S2 > >.
Definition at line 114 of file graph_elt_mixed_window.hh.
typedef S2::fun_t::result mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::site [inherited] |
Associated types.
The type of site corresponding to the window.
Definition at line 48 of file graph_window_base.hh.
typedef internal::graph_mixed_window_iter_dispatch<G,S,S2> mln::graph_elt_mixed_window< G, S, S2 >::super_ [private] |
Definition at line 115 of file graph_elt_mixed_window.hh.
typedef super_::target mln::graph_elt_mixed_window< G, S, S2 >::target |
Associated types.
Definition at line 123 of file graph_elt_mixed_window.hh.
unsigned mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::delta | ( | ) | const [inherited] |
Return the maximum coordinate gap between the window center and a window point.
bool mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::is_centered | ( | ) | const [inherited] |
Is the window centered?
bool mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::is_empty | ( | ) | const [inherited] |
Interface of the concept Window.
Is the window is empty?
bool mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::is_neighbable_ | ( | ) | const [inherited] |
Is the window neighbable?
bool mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::is_symmetric | ( | ) | const [inherited] |
Is the window symmetric?
bool mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::is_valid | ( | ) | const [inherited] |
Return true by default.
self_& mln::graph_window_base< S2::fun_t::result , graph_elt_mixed_window< G, S, S2 > >::sym | ( | ) | [inherited] |
Apply a central symmetry to the target window.