#include <p_set.hh>
Public Types | |
typedef p_indexed_bkd_piter < self_ > | bkd_piter |
Backward Site_Iterator associated type. | |
typedef Site_Set< void > | category |
typedef P | element |
Element associated type. | |
typedef E | exact_t |
typedef p_indexed_fwd_piter < self_ > | fwd_piter |
Forward Site_Iterator associated type. | |
typedef P | i_element |
Insertion element associated type. | |
typedef fwd_piter | piter |
Site_Iterator associated type. | |
typedef p_indexed_psite< self_ > | psite |
Psite associated type. | |
typedef P | r_element |
Removal element associated type. | |
typedef subject< P >::ret | site |
Site associated type. | |
Public Member Functions | |
void | clear () |
Clear this set. | |
bool | has (const util::index &i) const |
Test if index i belongs to this point set. | |
bool | has (const P &p) const |
Test if p belongs to this point set. | |
bool | has (const psite &p) const |
Test if psite p belongs to this point set. | |
void | insert (const P &p) |
Insert a site p . | |
bool | is_empty () const |
Test if the site set is empty. | |
bool | is_valid () const |
Test this set validity so returns always true. | |
std::size_t | memory_size () const |
Return the size of this site set in memory. | |
unsigned | nsites () const |
Give the number of sites. | |
const P & | operator[] (unsigned i) const |
Return the i-th site. | |
p_set () | |
Constructor. | |
void | remove (const P &p) |
Remove a site p . | |
const std::vector< P > & | std_vector () const |
Return the corresponding std::vector of sites. | |
const util::set< P > & | util_set () const |
Return the corresponding util::set of sites. | |
Protected Attributes | |
util::set< P > | s_ |
Private Types | |
typedef p_set< P > | 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 . |
This is a mathematical set of sites (not a multi-set).
The parameter P
shall be a site or pseudo-site type.
Definition at line 70 of file p_set.hh.
typedef p_indexed_bkd_piter<self_> mln::p_set< P >::bkd_piter |
typedef Site_Set<void> mln::Site_Set< E >::category [inherited] |
typedef P mln::p_set< P >::element |
typedef E mln::Object< E >::exact_t [inherited] |
typedef p_indexed_fwd_piter<self_> mln::p_set< P >::fwd_piter |
typedef P mln::p_set< P >::i_element |
typedef fwd_piter mln::p_set< P >::piter |
typedef p_indexed_psite<self_> mln::p_set< P >::psite |
typedef P mln::p_set< P >::r_element |
typedef p_set<P> mln::p_set< P >::self_ [private] |
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.
mln::p_set< P >::p_set | ( | ) | [inline] |
void mln::p_set< P >::clear | ( | ) | [inline] |
Clear this set.
Definition at line 219 of file p_set.hh.
References mln::util::set< T >::clear(), and mln::p_set< P >::s_.
bool mln::p_set< P >::has | ( | const util::index & | i | ) | const [inline] |
Test if index i
belongs to this point set.
Definition at line 179 of file p_set.hh.
References mln::p_set< P >::nsites().
bool mln::p_set< P >::has | ( | const P & | p | ) | const [inline] |
Test if p
belongs to this point set.
Definition at line 159 of file p_set.hh.
References mln::util::set< T >::has(), and mln::p_set< P >::s_.
bool mln::p_set< P >::has | ( | const psite & | p | ) | const [inline] |
Test if psite p
belongs to this point set.
Definition at line 167 of file p_set.hh.
References mln::p_indexed_psite< S >::index(), mln::p_indexed_psite< S >::target_(), and mln::internal::pseudo_site_base_< P, E >::to_site().
void mln::p_set< P >::insert | ( | const P & | p | ) | [inline] |
Insert a site p
.
Definition at line 203 of file p_set.hh.
References mln::util::set< T >::insert(), and mln::p_set< P >::s_.
Referenced by mln::convert::to_p_set(), and mln::morpho::watershed::w_constructible().
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_set< P >::is_valid | ( | ) | const [inline] |
std::size_t mln::p_set< P >::memory_size | ( | ) | const [inline] |
Return the size of this site set in memory.
Definition at line 236 of file p_set.hh.
References mln::util::set< T >::memory_size(), and mln::p_set< P >::s_.
unsigned mln::p_set< P >::nsites | ( | ) | const [inline] |
Give the number of sites.
Definition at line 195 of file p_set.hh.
References mln::util::set< T >::nelements(), and mln::p_set< P >::s_.
Referenced by mln::p_key< K, P >::change_key(), mln::p_set< P >::has(), mln::morpho::watershed::topo_wst< I, N >::highest_fork(), mln::p_set< P >::operator[](), mln::p_key< K, P >::remove_key(), mln::p_key< K, P >::run_(), and mln::morpho::watershed::w_constructible().
const P & mln::p_set< P >::operator[] | ( | unsigned | i | ) | const [inline] |
Return the i-th
site.
Definition at line 227 of file p_set.hh.
References mln::p_set< P >::nsites(), and mln::p_set< P >::s_.
void mln::p_set< P >::remove | ( | const P & | p | ) | [inline] |
Remove a site p
.
Definition at line 211 of file p_set.hh.
References mln::util::set< T >::remove(), and mln::p_set< P >::s_.
const std::vector< P > & mln::p_set< P >::std_vector | ( | ) | const [inline] |
Return the corresponding std::vector of sites.
Definition at line 244 of file p_set.hh.
References mln::p_set< P >::s_, and mln::util::set< T >::std_vector().
const util::set< P > & mln::p_set< P >::util_set | ( | ) | const [inline] |
Return the corresponding util::set of sites.
Definition at line 252 of file p_set.hh.
References mln::p_set< P >::s_.
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] |
util::set<P> mln::p_set< P >::s_ [protected] |
Definition at line 143 of file p_set.hh.
Referenced by mln::p_set< P >::clear(), mln::p_set< P >::has(), mln::p_set< P >::insert(), mln::p_set< P >::memory_size(), mln::p_set< P >::nsites(), mln::p_set< P >::operator[](), mln::p_set< P >::remove(), mln::p_set< P >::std_vector(), and mln::p_set< P >::util_set().