#include <p_if.hh>

Public Types | |
| typedef p_if_piter_< typename S::bkd_piter, S, F > | bkd_piter |
| Backward Site_Iterator associated type. | |
| typedef Site_Set< void > | category |
| typedef S::element | element |
| Element associated type. | |
| typedef E | exact_t |
| typedef p_if_piter_< typename S::fwd_piter, S, F > | fwd_piter |
| Forward Site_Iterator associated type. | |
| typedef fwd_piter | piter |
| Site_Iterator associated type. | |
| typedef S::psite | psite |
| Psite associated type. | |
| typedef subject< P >::ret | site |
| Site associated type. | |
Public Member Functions | |
| bool | has (const psite &p) const |
Test if p belongs to the subset. | |
| bool | is_empty () const |
| Test if the site set is empty. | |
| bool | is_valid () const |
| Test if this site set is valid. | |
| std::size_t | memory_size () const |
| Return the size of this site set in memory. | |
| const S & | overset () const |
| Give the primary overset. | |
| p_if () | |
| Constructor without argument. | |
| p_if (const S &s, const F &f) | |
Constructor with a site set s and a predicate f. | |
| bool | pred (const psite &p) const |
Test predicate on point site p. | |
| const F & | predicate () const |
| Give the predicate function. | |
Protected Attributes | |
| F | f_ |
| S | s_ |
Package Attributes | |
| __pad0__:site_set_base_<typename S ::psite | |
| self_ | super_ |
Private Types | |
| typedef p_if< S, F > | self_ |
Related Functions | |
| (Note that these are not member functions.) | |
| template<typename Sl, typename Sr> | |
| p_set< typename Sl::site > | diff (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Set theoretic difference of lhs and rhs. | |
| template<typename Sl, typename Sr> | |
| p_set< typename Sl::site > | inter (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
| Intersection between a couple of point sets. | |
| template<typename Sl, typename Sr> | |
| bool | operator< (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Strict inclusion test between site sets lhs and rhs. | |
| template<typename S> | |
| std::ostream & | operator<< (std::ostream &ostr, const Site_Set< S > &set) |
Print a site set set into the output stream ostr. | |
| template<typename Sl, typename Sr> | |
| bool | operator<= (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Inclusion test between site sets lhs and rhs. | |
| template<typename Sl, typename Sr> | |
| bool | operator== (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Equality test between site sets lhs and rhs. | |
| template<typename Sl, typename Sr> | |
| p_set< typename Sl::site > | sym_diff (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
Set theoretic symmetrical difference of lhs and rhs. | |
| template<typename Sl, typename Sr> | |
| p_set< typename Sl::site > | uni (const Site_Set< Sl > &lhs, const Site_Set< Sr > &rhs) |
| Union of a couple of point sets. | |
| template<typename S> | |
| p_set< typename S::site > | unique (const Site_Set< S > &s) |
Give the unique set of s. | |
a predicate.
Parameter S is a site set type; parameter F is a function from point to Boolean.
Definition at line 83 of file p_if.hh.
| typedef p_if_piter_<typename S ::bkd_piter, S, F> mln::p_if< S, F >::bkd_piter |
typedef Site_Set<void> mln::Site_Set< E >::category [inherited] |
typedef E mln::Object< E >::exact_t [inherited] |
| typedef p_if_piter_<typename S ::fwd_piter, S, F> mln::p_if< S, F >::fwd_piter |
typedef subject<P>::ret mln::internal::site_set_base_< P, E >::site [inherited] |
Site associated type.
Reimplemented in mln::p_centered< W >.
Definition at line 55 of file site_set_base.hh.
Test if p belongs to the subset.
Definition at line 159 of file p_if.hh.
References mln::p_if< S, F >::f_, and mln::p_if< S, F >::has().
Referenced by mln::p_if< S, F >::has().
| bool mln::internal::site_set_base_< P, E >::is_empty | ( | ) | const [inline, inherited] |
Test if the site set is empty.
This final method dispatches to is_empty_ whose default implementation relies on the 'nsites' method.
Definition at line 84 of file site_set_base.hh.
References mln::exact().
Referenced by mln::canvas::labeling::impl::generic::blobs(), mln::p_set_of< S >::clear(), mln::p_mutable_array_of< S >::clear(), mln::p_array< P >::clear(), mln::canvas::impl::generic::distance_geodesic(), mln::morpho::watershed::impl::generic::flooding(), mln::morpho::watershed::impl::flooding_fastest(), mln::p_queue_fast< P >::front(), mln::p_queue< P >::front(), mln::p_priority< P, Q >::front(), mln::p_priority< P, Q >::highest_priority(), mln::registration::icp(), mln::influence_zones(), mln::p_priority< P, Q >::lowest_priority(), mln::morpho::meyer_wst(), mln::p_queue_fast< P >::pop(), mln::p_queue< P >::pop(), mln::p_priority< P, Q >::pop(), mln::p_queue_fast< P >::pop_front(), mln::p_queue< P >::pop_front(), mln::p_priority< P, Q >::pop_front(), mln::registration::internal::registration_tests(), mln::geom::impl::seeds2tiling(), mln::geom::impl::seeds2tiling_roundness(), mln::morpho::skeleton_constrained(), and mln::morpho::watershed::topological().
| bool mln::p_if< S, F >::is_valid | ( | ) | const [inline] |
| std::size_t mln::p_if< S, F >::memory_size | ( | ) | const [inline] |
| const S & mln::p_if< S, F >::overset | ( | ) | const [inline] |
Give the primary overset.
Definition at line 175 of file p_if.hh.
Referenced by mln::p_if_piter_< Pi, S, F >::pi_change_target_().
Test predicate on point site p.
Definition at line 183 of file p_if.hh.
References mln::p_if< S, F >::f_.
| const F & mln::p_if< S, F >::predicate | ( | ) | const [inline] |
| bool operator< | ( | const Site_Set< Sl > & | lhs, | |
| const Site_Set< Sr > & | rhs | |||
| ) | [related, inherited] |
| std::ostream & operator<< | ( | std::ostream & | ostr, | |
| const Site_Set< S > & | set | |||
| ) | [related, inherited] |
| bool operator<= | ( | const Site_Set< Sl > & | lhs, | |
| const Site_Set< Sr > & | rhs | |||
| ) | [related, inherited] |
| bool operator== | ( | const Site_Set< Sl > & | lhs, | |
| const Site_Set< Sr > & | rhs | |||
| ) | [related, inherited] |
Definition at line 136 of file p_if.hh.
Referenced by mln::p_if< S, F >::has(), and mln::p_if< S, F >::pred().
1.5.6