#include <p_queue.hh>
Inherits site_set_base_< P, p_queue< 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. | |
Public Member Functions | |
void | clear () |
Clear the queue. | |
const P & | front () const |
Give the front site p of the queue; p is the least recently inserted site. | |
bool | has (const util::index &i) const |
Test if index i belongs to this site set. | |
bool | has (const psite &p) const |
Test if p belongs to this site set. | |
void | insert (const P &p) |
Insert a site p (equivalent as 'push'). | |
bool | is_valid () const |
This set is always valid so it returns 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_queue () | |
Constructor without argument. | |
void | pop () |
Pop (remove) the front site p from the queue; p is the least recently inserted site. | |
P | pop_front () |
Pop (remove) the front site p from the queue; p is the least recently inserted site and give the front site p of the queue; p is the least recently inserted site. | |
void | push (const P &p) |
Push a site p in the queue. | |
const std::deque< P > & | std_deque () const |
Return the corresponding std::deque of sites. |
The parameter P
shall be a site or pseudo-site type.
typedef p_indexed_bkd_piter<self_> mln::p_queue< P >::bkd_piter |
Backward Site_Iterator associated type.
typedef P mln::p_queue< P >::element |
Element associated type.
typedef p_indexed_fwd_piter<self_> mln::p_queue< P >::fwd_piter |
Forward Site_Iterator associated type.
typedef P mln::p_queue< P >::i_element |
Insertion element associated type.
typedef fwd_piter mln::p_queue< P >::piter |
Site_Iterator associated type.
typedef p_indexed_psite<self_> mln::p_queue< P >::psite |
Psite associated type.
mln::p_queue< P >::p_queue | ( | ) | [inline] |
Constructor without argument.
void mln::p_queue< P >::clear | ( | ) | [inline] |
Clear the queue.
const P & mln::p_queue< P >::front | ( | ) | const [inline] |
Give the front site p
of the queue; p
is the least recently inserted site.
Referenced by mln::p_queue< P >::pop_front(), and mln::geom::impl::seeds2tiling().
bool mln::p_queue< P >::has | ( | const util::index & | i | ) | const [inline] |
bool mln::p_queue< P >::has | ( | const psite & | p | ) | const [inline] |
void mln::p_queue< P >::insert | ( | const P & | p | ) | [inline] |
bool mln::p_queue< P >::is_valid | ( | ) | const [inline] |
This set is always valid so it returns true.
std::size_t mln::p_queue< P >::memory_size | ( | ) | const [inline] |
unsigned mln::p_queue< P >::nsites | ( | ) | const [inline] |
Give the number of sites.
Referenced by mln::p_queue< P >::has(), mln::p_queue< P >::memory_size(), and mln::p_queue< P >::operator[]().
const P & mln::p_queue< P >::operator[] | ( | unsigned | i | ) | const [inline] |
void mln::p_queue< P >::pop | ( | ) | [inline] |
Pop (remove) the front site p
from the queue; p
is the least recently inserted site.
Referenced by mln::p_queue< P >::pop_front(), and mln::geom::impl::seeds2tiling().
P mln::p_queue< P >::pop_front | ( | ) | [inline] |
Pop (remove) the front site p
from the queue; p
is the least recently inserted site and give the front site p
of the queue; p
is the least recently inserted site.
References mln::p_queue< P >::front(), and mln::p_queue< P >::pop().
void mln::p_queue< P >::push | ( | const P & | p | ) | [inline] |
Push a site p
in the queue.
Referenced by mln::p_queue< P >::insert(), and mln::geom::impl::seeds2tiling().
const std::deque< P > & mln::p_queue< P >::std_deque | ( | ) | const [inline] |
Return the corresponding std::deque of sites.