#include <p_mutable_array_of.hh>
Public Types | |
typedef p_double_piter< self_, mln_bkd_eiter(array_), typename S::bkd_piter > | bkd_piter |
Backward Site_Iterator associated type. | |
typedef Site_Set< void > | category |
typedef S | element |
Element associated type. | |
typedef E | exact_t |
typedef p_double_piter< self_, mln_fwd_eiter(array_), typename S::fwd_piter > | fwd_piter |
Forward Site_Iterator associated type. | |
typedef S | i_element |
Insertion element associated type. | |
typedef fwd_piter | piter |
Site_Iterator associated type. | |
typedef p_double_psite< self_, element > | psite |
Psite associated type. | |
typedef subject< P >::ret | site |
Site associated type. | |
Public Member Functions | |
const util::array< S > & | array_hook_ () const |
Hook to the set of runs. | |
void | clear () |
Clear this set. | |
bool | has (const psite &p) const |
Test if p belongs to this point set. | |
void | insert (const S &s) |
Insert a site set s . | |
bool | is_empty () const |
Test if the site set is empty. | |
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 | nelements () const |
Give the number of elements (site sets) of this composite. | |
S & | operator[] (unsigned i) |
Return the i-th site set (mutable version). | |
const S & | operator[] (unsigned i) const |
Return the i-th site set (const version). | |
p_mutable_array_of () | |
Constructor without arguments. | |
void | reserve (unsigned n) |
Reserve memory for n elements. | |
const util::array< S > & | set_1_ () const |
template<typename I> | |
const S & | set_2_ (const I &it) const |
Protected Attributes | |
util::array< S > | arr_ |
Array of site sets. | |
Private Types | |
typedef util::array< S > | array_ |
typedef p_mutable_array_of< S > | 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 . |
Parameter S
is the type of the contained site sets.
Definition at line 76 of file p_mutable_array_of.hh.
typedef util::array<S> mln::p_mutable_array_of< S >::array_ [private] |
Definition at line 81 of file p_mutable_array_of.hh.
typedef p_double_piter<self_, mln_bkd_eiter(array_), typename S ::bkd_piter> mln::p_mutable_array_of< S >::bkd_piter |
typedef Site_Set<void> mln::Site_Set< E >::category [inherited] |
typedef S mln::p_mutable_array_of< S >::element |
typedef E mln::Object< E >::exact_t [inherited] |
typedef p_double_piter<self_, mln_fwd_eiter(array_), typename S ::fwd_piter> mln::p_mutable_array_of< S >::fwd_piter |
typedef S mln::p_mutable_array_of< S >::i_element |
typedef fwd_piter mln::p_mutable_array_of< S >::piter |
typedef p_double_psite<self_, element> mln::p_mutable_array_of< S >::psite |
typedef p_mutable_array_of<S> mln::p_mutable_array_of< S >::self_ [private] |
Definition at line 80 of file p_mutable_array_of.hh.
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_mutable_array_of< S >::p_mutable_array_of | ( | ) | [inline] |
const util::array< S > & mln::p_mutable_array_of< S >::array_hook_ | ( | ) | const [inline] |
Hook to the set of runs.
Definition at line 266 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_.
void mln::p_mutable_array_of< S >::clear | ( | ) | [inline] |
Clear this set.
Definition at line 241 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, mln::util::array< T >::clear(), and mln::internal::site_set_base_< P, E >::is_empty().
bool mln::p_mutable_array_of< S >::has | ( | const psite & | p | ) | const [inline] |
Test if p
belongs to this point set.
Definition at line 190 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, mln::p_double_psite< S, Sp >::index(), mln::util::array< T >::nelements(), and mln::p_double_psite< S, Sp >::p().
void mln::p_mutable_array_of< S >::insert | ( | const S & | s | ) | [inline] |
Insert a site set s
.
s
is valid. Definition at line 206 of file p_mutable_array_of.hh.
References mln::util::array< T >::append(), and mln::p_mutable_array_of< S >::arr_.
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_mutable_array_of< S >::is_empty_ | ( | ) | const [inline] |
Test if the site set is empty.
Reimplemented from mln::internal::site_set_base_< P, E >.
Definition at line 250 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, and mln::util::array< T >::is_empty().
bool mln::p_mutable_array_of< S >::is_valid | ( | ) | const [inline] |
Test this set validity so returns always true.
Definition at line 198 of file p_mutable_array_of.hh.
std::size_t mln::p_mutable_array_of< S >::memory_size | ( | ) | const [inline] |
Return the size of this site set in memory.
Definition at line 258 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, and mln::util::array< T >::memory_size().
unsigned mln::p_mutable_array_of< S >::nelements | ( | ) | const [inline] |
Give the number of elements (site sets) of this composite.
Definition at line 233 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, and mln::util::array< T >::nelements().
S & mln::p_mutable_array_of< S >::operator[] | ( | unsigned | i | ) | [inline] |
Return the i-th
site set (mutable version).
Definition at line 224 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, and mln::util::array< T >::nelements().
const S & mln::p_mutable_array_of< S >::operator[] | ( | unsigned | i | ) | const [inline] |
Return the i-th
site set (const version).
Definition at line 215 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, and mln::util::array< T >::nelements().
void mln::p_mutable_array_of< S >::reserve | ( | unsigned | n | ) | [inline] |
Reserve memory for n
elements.
Definition at line 182 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_, and mln::util::array< T >::reserve().
const util::array< S > & mln::p_mutable_array_of< S >::set_1_ | ( | ) | const [inline] |
Definition at line 274 of file p_mutable_array_of.hh.
References mln::p_mutable_array_of< S >::arr_.
const S & mln::p_mutable_array_of< S >::set_2_ | ( | const I & | it | ) | const [inline] |
Definition at line 283 of file p_mutable_array_of.hh.
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::array<S> mln::p_mutable_array_of< S >::arr_ [protected] |
Array of site sets.
Definition at line 160 of file p_mutable_array_of.hh.
Referenced by mln::p_mutable_array_of< S >::array_hook_(), mln::p_mutable_array_of< S >::clear(), mln::p_mutable_array_of< S >::has(), mln::p_mutable_array_of< S >::insert(), mln::p_mutable_array_of< S >::is_empty_(), mln::p_mutable_array_of< S >::memory_size(), mln::p_mutable_array_of< S >::nelements(), mln::p_mutable_array_of< S >::operator[](), mln::p_mutable_array_of< S >::reserve(), and mln::p_mutable_array_of< S >::set_1_().