mln::graph_elt_window< G, S > Class Template Reference
Elementary window on graph class. More...
#include <graph_elt_window.hh>
Public Types | |
| typedef Window< void > | category |
| typedef E | exact_t |
| typedef graph_window_piter< S, self_, nbh_bkd_iter_ > | bkd_qiter |
| Site_Iterator type to browse the psites of the window w.r.t. | |
| typedef S::psite | center_t |
| Type of the window center element. | |
| typedef graph_window_piter< S, self_, nbh_fwd_iter_ > | fwd_qiter |
| Site_Iterator type to browse the psites of the window w.r.t. | |
| typedef S::graph_element | graph_element |
| Type of the graph element pointed by this iterator. | |
| typedef S::psite | psite |
| The type of psite corresponding to the window. | |
| typedef fwd_qiter | qiter |
| The default qiter type. | |
| typedef S | target |
| Associated types. | |
| typedef void | dpsite |
| typedef P | site |
| Associated types. | |
Public Member Functions | |
| bool | is_valid () const |
| Return true by default. | |
| unsigned | delta () const |
| Return the maximum coordinate gap between the window center and a window point. | |
| bool | is_centered () const |
| Is the window centered? | |
| bool | is_empty () const |
| Interface of the concept Window. | |
| bool | is_neighbable_ () const |
| Is the window neighbable? | |
| bool | is_symmetric () const |
| Is the window symmetric? | |
| self_ & | sym () |
| Apply a central symmetry to the target window. | |
Package Types | |
| typedef super_::nbh_bkd_iter_ | nbh_bkd_iter_ |
| typedef super_::nbh_fwd_iter_ | nbh_fwd_iter_ |
Package Attributes | |
| __pad0__:graph_window_iter_dispatch<G | |
| S | super_ |
Private Types | |
| typedef graph_elt_window< G, S > | self_ |
Detailed Description
template<typename G, typename S>
class mln::graph_elt_window< G, S >
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 111 of file graph_elt_window.hh.
Member Typedef Documentation
| typedef graph_window_piter<S,self_,nbh_bkd_iter_> mln::graph_elt_window< G, S >::bkd_qiter |
Site_Iterator type to browse the psites of the window w.r.t.
the reverse ordering of vertices.
Definition at line 142 of file graph_elt_window.hh.
typedef Window<void> mln::Window< E >::category [inherited] |
| typedef S ::psite mln::graph_elt_window< G, S >::center_t |
typedef void mln::graph_window_base< P, E >::dpsite [inherited] |
Definition at line 51 of file graph_window_base.hh.
typedef E mln::Object< E >::exact_t [inherited] |
| typedef graph_window_piter<S,self_,nbh_fwd_iter_> mln::graph_elt_window< G, S >::fwd_qiter |
Site_Iterator type to browse the psites of the window w.r.t.
the ordering of vertices.
Definition at line 138 of file graph_elt_window.hh.
| typedef S ::graph_element mln::graph_elt_window< G, S >::graph_element |
Type of the graph element pointed by this iterator.
Definition at line 134 of file graph_elt_window.hh.
typedef super_::nbh_bkd_iter_ mln::graph_elt_window< G, S >::nbh_bkd_iter_ [package] |
Definition at line 120 of file graph_elt_window.hh.
typedef super_::nbh_fwd_iter_ mln::graph_elt_window< G, S >::nbh_fwd_iter_ [package] |
Definition at line 119 of file graph_elt_window.hh.
| typedef S ::psite mln::graph_elt_window< G, S >::psite |
| typedef fwd_qiter mln::graph_elt_window< G, S >::qiter |
typedef graph_elt_window<G,S> mln::graph_elt_window< G, S >::self_ [private] |
Reimplemented from mln::graph_window_base< P, E >.
Definition at line 116 of file graph_elt_window.hh.
typedef P mln::graph_window_base< P, E >::site [inherited] |
Associated types.
The type of site corresponding to the window.
Definition at line 48 of file graph_window_base.hh.
| typedef S mln::graph_elt_window< G, S >::target |
Member Function Documentation
| unsigned mln::graph_window_base< P, E >::delta | ( | ) | const [inline, inherited] |
Return the maximum coordinate gap between the window center and a window point.
Definition at line 128 of file graph_window_base.hh.
| bool mln::graph_window_base< P, E >::is_centered | ( | ) | const [inline, inherited] |
| bool mln::graph_window_base< P, E >::is_empty | ( | ) | const [inline, inherited] |
Interface of the concept Window.
Is the window is empty?
Definition at line 104 of file graph_window_base.hh.
| bool mln::graph_window_base< P, E >::is_neighbable_ | ( | ) | const [inline, inherited] |
| bool mln::graph_window_base< P, E >::is_symmetric | ( | ) | const [inline, inherited] |
| bool mln::graph_window_base< P, E >::is_valid | ( | ) | const [inline, inherited] |
Return true by default.
Reimplemented in mln::graph_elt_window_if< G, S, I >.
Definition at line 153 of file graph_window_base.hh.
| graph_window_base< P, E > & mln::graph_window_base< P, E >::sym | ( | ) | [inline, inherited] |
Member Data Documentation
mln::graph_elt_window< G, S >::__pad0__ [package] |
Definition at line 117 of file graph_elt_window.hh.
S mln::graph_elt_window< G, S >::super_ [package] |
Definition at line 117 of file graph_elt_window.hh.
