Mathematical set of sites (based on util::set). More...
#include <p_set.hh>
Inherits site_set_base_< P, p_set< P > >.
Public Types | |
| typedef p_indexed_bkd_piter < self_ >  | bkd_piter | 
| Backward Site_Iterator associated type.   | |
| typedef P | element | 
| Element associated type.   | |
| 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.   | |
Public Member Functions | |
| void | clear () | 
| Clear this set.   | |
| bool | has (const psite &p) const | 
Test if psite p belongs to this point 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.   | |
| void | insert (const P &p) | 
Insert a site p.   | |
| 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.   | |
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. 
Definition at line 70 of file p_set.hh.
| typedef p_indexed_bkd_piter<self_> mln::p_set< P >::bkd_piter | 
Backward Site_Iterator associated type.
| typedef P mln::p_set< P >::element | 
| 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 | 
| mln::p_set< P >::p_set | ( | ) |  [inline] | 
        
| void mln::p_set< P >::clear | ( | ) |  [inline] | 
        
| bool mln::p_set< P >::has | ( | const psite & | p | ) |  const [inline] | 
        
| bool mln::p_set< P >::has | ( | const P & | p | ) |  const [inline] | 
        
| 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().
| void mln::p_set< P >::insert | ( | const P & | p | ) |  [inline] | 
        
| bool mln::p_set< P >::is_valid | ( | ) |  const [inline] | 
        
| std::size_t mln::p_set< P >::memory_size | ( | ) |  const [inline] | 
        
| unsigned mln::p_set< P >::nsites | ( | ) |  const [inline] | 
        
Give the number of sites.
Definition at line 195 of file p_set.hh.
Referenced by mln::p_key< K, P >::change_key(), mln::p_set< P >::has(), mln::p_set< P >::operator[](), and mln::p_key< K, P >::remove_key().
| 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().
| void mln::p_set< P >::remove | ( | const P & | p | ) |  [inline] | 
        
| const std::vector< P > & mln::p_set< P >::std_vector | ( | ) |  const [inline] | 
        
| const util::set< P > & mln::p_set< P >::util_set | ( | ) |  const [inline] | 
        
 1.7.1