$extrastylesheet
#include <mln/core/site_set/p_set.hh>
Public Member Functions | |
| p_set () | |
| void | clear () |
| bool | has (const psite &p) const |
| bool | has (const P &p) const |
| bool | has (const util::index &i) const |
| void | insert (const P &p) |
| bool | is_empty () const |
| bool | is_valid () const |
| std::size_t | memory_size () const |
| unsigned | nsites () const |
| const P & | operator[] (unsigned i) const |
| void | remove (const P &p) |
| const std::vector< P > & | std_vector () const |
| const util::set< P > & | util_set () const |
Protected Attributes | |
| util::set< P > | s_ |
Public Types | |
| typedef p_indexed_bkd_piter < self_ > | bkd_piter |
| typedef Site_Set< void > | category |
| typedef P | element |
| typedef p_set< P > | exact_t |
| typedef p_indexed_fwd_piter < self_ > | fwd_piter |
| typedef P | i_element |
| typedef fwd_piter | piter |
| typedef p_indexed_psite< self_ > | psite |
| typedef P | r_element |
| typedef subject< P >::ret | site |
Mathematical set of sites (based on util::set).
This is a mathematical set of sites (not a multi-set).
The parameter P shall be a site or pseudo-site type.
| mln::p_set< P >::p_set | ( | ) |
Constructor.
| void mln::p_set< P >::clear | ( | ) |
Clear this set.
| bool mln::p_set< P >::has | ( | const psite & | p | ) | const |
Test if psite p belongs to this point set.
| bool mln::p_set< P >::has | ( | const P & | p | ) | const |
Test if p belongs to this point set.
| bool mln::p_set< P >::has | ( | const util::index & | i | ) | const |
Test if index i belongs to this point set.
| void mln::p_set< P >::insert | ( | const P & | p | ) |
Insert a site p.
| bool mln::p_set< P >::is_empty | ( | ) | const |
Is the set empty?
Reimplemented from mln::internal::site_set_base_< P, p_set< P > >.
| bool mln::p_set< P >::is_valid | ( | ) | const |
Test this set validity so returns always true.
| std::size_t mln::p_set< P >::memory_size | ( | ) | const |
Return the size of this site set in memory.
| unsigned mln::p_set< P >::nsites | ( | ) | const |
Give the number of sites.
| const P& mln::p_set< P >::operator[] | ( | unsigned | i | ) | const |
Return the i-th site.
| void mln::p_set< P >::remove | ( | const P & | p | ) |
Remove a site p.
| const std::vector<P>& mln::p_set< P >::std_vector | ( | ) | const |
Return the corresponding std::vector of sites.
| const util::set<P>& mln::p_set< P >::util_set | ( | ) | const |
Return the corresponding util::set of sites.
|
protected |
| typedef p_indexed_bkd_piter<self_> mln::p_set< P >::bkd_piter |
Backward Site_Iterator associated type.
|
inherited |
Definition at line 74 of file core/concept/site_set.hh.
| typedef P mln::p_set< P >::element |
|
inherited |
| typedef p_indexed_fwd_piter<self_> mln::p_set< P >::fwd_piter |
Forward Site_Iterator associated type.
| typedef P mln::p_set< P >::i_element |
| typedef fwd_piter mln::p_set< P >::piter |
Site_Iterator associated type.
| typedef p_indexed_psite<self_> mln::p_set< P >::psite |
| typedef P mln::p_set< P >::r_element |
|
inherited |
Site associated type.
Definition at line 58 of file site_set_base.hh.