Priority queue class. More...
#include <p_key.hh>
Inherits site_set_base_< P, p_key< K, P > >.
Public Types | |
| typedef p_double_piter< self_, mln_bkd_eiter(util::set< K > ), typename p_set< P > ::bkd_piter > | bkd_piter |
| Backward Site_Iterator associated type. | |
| typedef P | element |
| Element associated type. | |
| typedef p_double_piter< self_, mln_fwd_eiter(util::set< K > ), typename p_set< P > ::fwd_piter > | fwd_piter |
| Forward Site_Iterator associated type. | |
| typedef std::pair< K, P > | i_element |
| Insertion element associated type. | |
| typedef fwd_piter | piter |
| Site_Iterator associated type. | |
| typedef p_double_psite< self_, p_set< P > > | psite |
| Psite associated type. | |
| typedef P | r_element |
| Removal element associated type. | |
Public Member Functions | |
| void | change_key (const K &k, const K &new_k) |
Change the key k into a new value new_k. | |
| template<typename F > | |
| void | change_keys (const Function_v2v< F > &f) |
Change the keys by applying the function f. | |
| void | clear () |
| Clear this site set. | |
| bool | exists_key (const K &key) const |
Test if the priority exists. | |
| bool | has (const psite &) const |
Test is the psite p belongs to this site set. | |
| bool | has (const P &p) const |
Test is the psite p belongs to this site set. | |
| void | insert (const i_element &k_p) |
Insert a pair k_p (key k, site p). | |
| void | insert (const K &k, const P &p) |
Insert a pair (key k, site p). | |
| bool | is_valid () const |
| Test this set validity so returns always true. | |
| const K & | key (const P &p) const |
Give the key associated with site p. | |
| const util::set< K > & | keys () const |
| Give the set of keys. | |
| 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_set< P > & | operator() (const K &key) const |
Give the queue with the priority priority. | |
| p_key () | |
| Constructor. | |
| void | remove (const P &p) |
Remove a site p. | |
| void | remove_key (const K &k) |
Remove all sites with key k. | |
Priority queue class.
Definition at line 72 of file p_key.hh.
| 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.
| typedef P mln::p_key< K, P >::element |
| 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 |
| 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 |
| mln::p_key< K, P >::p_key | ( | ) | [inline] |
| void mln::p_key< K, P >::change_key | ( | const K & | k, | |
| const K & | new_k | |||
| ) | [inline] |
Change the key k into a new value new_k.
Definition at line 382 of file p_key.hh.
References mln::p_set< P >::nsites().
| void mln::p_key< K, P >::change_keys | ( | const Function_v2v< F > & | f | ) | [inline] |
Change the keys by applying the function f.
Definition at line 428 of file p_key.hh.
References mln::util::set< T >::insert().
| void mln::p_key< K, P >::clear | ( | ) | [inline] |
| bool mln::p_key< K, P >::exists_key | ( | const K & | key | ) | const [inline] |
Test if the priority exists.
Definition at line 520 of file p_key.hh.
Referenced by mln::p_key< K, P >::operator()().
| bool mln::p_key< K, P >::has | ( | const P & | p | ) | const [inline] |
| bool mln::p_key< K, P >::has | ( | const psite & | ) | const [inline] |
Test is the psite p belongs to this site set.
Definition at line 217 of file p_key.hh.
Referenced by mln::p_key< K, P >::insert().
| void mln::p_key< K, P >::insert | ( | const i_element & | k_p | ) | [inline] |
| void mln::p_key< K, P >::insert | ( | const K & | k, | |
| const P & | p | |||
| ) | [inline] |
Insert a pair (key k, site p).
Definition at line 268 of file p_key.hh.
References mln::p_key< K, P >::has().
| bool mln::p_key< K, P >::is_valid | ( | ) | const [inline] |
| const K & mln::p_key< K, P >::key | ( | const P & | p | ) | const [inline] |
| const util::set< K > & mln::p_key< K, P >::keys | ( | ) | const [inline] |
| std::size_t mln::p_key< K, P >::memory_size | ( | ) | const [inline] |
| unsigned mln::p_key< K, P >::nsites | ( | ) | const [inline] |
| const p_set< P > & mln::p_key< K, P >::operator() | ( | const K & | key | ) | const [inline] |
Give the queue with the priority priority.
This method always works: if the priority is not in this set, an empty queue is returned.
Definition at line 489 of file p_key.hh.
References mln::p_key< K, P >::exists_key().
| void mln::p_key< K, P >::remove | ( | const P & | p | ) | [inline] |
| void mln::p_key< K, P >::remove_key | ( | const K & | k | ) | [inline] |
Remove all sites with key k.
Definition at line 351 of file p_key.hh.
References mln::p_set< P >::nsites().
1.7.1