$extrastylesheet
#include <mln/core/site_set/p_key.hh>
Public Member Functions | |
| p_key () | |
| void | change_key (const K &k, const K &new_k) |
| template<typename F > | |
| void | change_keys (const Function_v2v< F > &f) |
| void | clear () |
| bool | exists_key (const K &key) const |
| bool | has (const psite &) const |
| bool | has (const P &p) const |
| void | insert (const i_element &k_p) |
| void | insert (const K &k, const P &p) |
| bool | is_empty () const |
| bool | is_valid () const |
| const K & | key (const P &p) const |
| const util::set< K > & | keys () const |
| std::size_t | memory_size () const |
| unsigned | nsites () const |
| const p_set< P > & | operator() (const K &key) const |
| void | remove (const P &p) |
| void | remove_key (const K &k) |
Protected Member Functions | |
| bool | run_ () const |
Protected Attributes | |
| util::set< K > | b_ |
| k_t | k_ |
| unsigned | n_ |
| s_t | s_ |
Public Types | |
| typedef p_double_piter< self_, mln_bkd_eiter(util::set< K > ), typename p_set< P > ::bkd_piter > | bkd_piter |
| typedef Site_Set< void > | category |
| typedef P | element |
| typedef p_key< K, P > | exact_t |
| typedef p_double_piter< self_, mln_fwd_eiter(util::set< K > ), typename p_set< P > ::fwd_piter > | fwd_piter |
| typedef std::pair< K, P > | i_element |
| typedef fwd_piter | piter |
| typedef p_double_psite< self_, p_set< P > > | psite |
| typedef P | r_element |
| typedef subject< P >::ret | site |
Protected Types | |
| typedef std::map< P, K, util::ord< P > > | k_t |
| typedef std::map< K, p_set< P > , util::ord< K > > | s_t |
Related Functions | |
(Note that these are not member functions.) | |
| template<typename K , typename P > | |
| std::ostream & | operator<< (std::ostream &ostr, const p_key< K, P > &pk) |
Priority queue class.
| mln::p_key< K, P >::p_key | ( | ) |
Constructor.
| void mln::p_key< K, P >::change_key | ( | const K & | k, |
| const K & | new_k | ||
| ) |
Change the key k into a new value new_k.
| void mln::p_key< K, P >::change_keys | ( | const Function_v2v< F > & | f | ) |
Change the keys by applying the function f.
| void mln::p_key< K, P >::clear | ( | ) |
Clear this site set.
| bool mln::p_key< K, P >::exists_key | ( | const K & | key | ) | const |
Test if the priority exists.
| bool mln::p_key< K, P >::has | ( | const psite & | ) | const |
Test is the psite p belongs to this site set.
| bool mln::p_key< K, P >::has | ( | const P & | p | ) | const |
Test is the psite p belongs to this site set.
| void mln::p_key< K, P >::insert | ( | const i_element & | k_p | ) |
Insert a pair k_p (key k, site p).
| void mln::p_key< K, P >::insert | ( | const K & | k, |
| const P & | p | ||
| ) |
Insert a pair (key k, site p).
|
inherited |
Test if the site set is empty.
This final method dispatches to is_empty_ whose default implementation relies on the 'nsites' method.
| bool mln::p_key< K, P >::is_valid | ( | ) | const |
Test this set validity so returns always true.
| const K& mln::p_key< K, P >::key | ( | const P & | p | ) | const |
Give the key associated with site p.
| const util::set<K>& mln::p_key< K, P >::keys | ( | ) | const |
Give the set of keys.
| std::size_t mln::p_key< K, P >::memory_size | ( | ) | const |
Return the size of this site set in memory.
| unsigned mln::p_key< K, P >::nsites | ( | ) | const |
Give the number of sites.
| const p_set<P>& mln::p_key< K, P >::operator() | ( | const K & | key | ) | const |
Give the queue with the priority priority.
This method always works: if the priority is not in this set, an empty queue is returned.
| void mln::p_key< K, P >::remove | ( | const P & | p | ) |
Remove a site p.
| void mln::p_key< K, P >::remove_key | ( | const K & | k | ) |
Remove all sites with key k.
|
protected |
|
related |
|
protected |
|
protected |
|
protected |
|
protected |
| typedef p_double_piter<self_, mln_bkd_eiter(util::set<K>), typename p_set<P>::bkd_piter> mln::p_key< K, P >::bkd_piter |
Backward Site_Iterator associated type.
|
inherited |
Definition at line 74 of file core/concept/site_set.hh.
| typedef P mln::p_key< K, P >::element |
|
inherited |
| typedef p_double_piter<self_, mln_fwd_eiter(util::set<K>), typename p_set<P>::fwd_piter> mln::p_key< K, P >::fwd_piter |
Forward Site_Iterator associated type.
| typedef std::pair<K,P> mln::p_key< K, P >::i_element |
|
protected |
| typedef fwd_piter mln::p_key< K, P >::piter |
Site_Iterator associated type.
| typedef p_double_psite< self_, p_set<P> > mln::p_key< K, P >::psite |
| typedef P mln::p_key< K, P >::r_element |
|
protected |
|
inherited |
Site associated type.
Definition at line 58 of file site_set_base.hh.