mln::p_queue< P > Class Template Reference [Queue based]

Queue of sites (based on std::deque). More...

#include <p_queue.hh>

Inherits site_set_base_< P, p_queue< P > >.

List of all members.

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 psite &p) const
	Test if p belongs to this site set.
bool	has (const util::index &i) const
	Test if index i 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.

---

Detailed Description

template<typename P>
class mln::p_queue< P >

Queue of sites (based on std::deque).

The parameter P shall be a site or pseudo-site type.

Definition at line 74 of file p_queue.hh.

---

Member Typedef Documentation

template<typename P>

typedef p_indexed_bkd_piter<self_> mln::p_queue< P >::bkd_piter

Backward Site_Iterator associated type.

Definition at line 90 of file p_queue.hh.

template<typename P>

typedef P mln::p_queue< P >::element

Element associated type.

Definition at line 80 of file p_queue.hh.

template<typename P>

typedef p_indexed_fwd_piter<self_> mln::p_queue< P >::fwd_piter

Forward Site_Iterator associated type.

Definition at line 87 of file p_queue.hh.

template<typename P>

typedef P mln::p_queue< P >::i_element

Insertion element associated type.

Definition at line 118 of file p_queue.hh.

template<typename P>

typedef fwd_piter mln::p_queue< P >::piter

Site_Iterator associated type.

Definition at line 93 of file p_queue.hh.

template<typename P>

typedef p_indexed_psite<self_> mln::p_queue< P >::psite

Psite associated type.

Definition at line 84 of file p_queue.hh.

---

Constructor & Destructor Documentation

template<typename P >

mln::p_queue< P >::p_queue

(

)

[inline]

Constructor without argument.

Definition at line 163 of file p_queue.hh.

---

Member Function Documentation

template<typename P >

void mln::p_queue< P >::clear

(

)

[inline]

Clear the queue.

Definition at line 244 of file p_queue.hh.

template<typename P >

const P & mln::p_queue< P >::front

(

)

const [inline]

Give the front site p of the queue; p is the least recently inserted site.

Definition at line 224 of file p_queue.hh.

Referenced by mln::p_queue< P >::pop_front(), and mln::geom::impl::seeds2tiling().

template<typename P >

bool mln::p_queue< P >::has

(

const util::index &

i

)

const [inline]

Test if index i belongs to this site set.

Definition at line 183 of file p_queue.hh.

References mln::p_queue< P >::nsites().

template<typename P >

bool mln::p_queue< P >::has

(

const psite &

p

)

const [inline]

Test if p belongs to this site set.

Definition at line 170 of file p_queue.hh.

References mln::p_queue< P >::nsites().

template<typename P >

void mln::p_queue< P >::insert

(

const P &

p

)

[inline]

Insert a site p (equivalent as 'push').

Definition at line 261 of file p_queue.hh.

References mln::p_queue< P >::push().

template<typename P >

bool mln::p_queue< P >::is_valid

(

)

const [inline]

This set is always valid so it returns true.

Definition at line 191 of file p_queue.hh.

template<typename P >

std::size_t mln::p_queue< P >::memory_size

(

)

const [inline]

Return the size of this site set in memory.

Definition at line 277 of file p_queue.hh.

References mln::p_queue< P >::nsites().

template<typename P >

unsigned mln::p_queue< P >::nsites

(

)

const [inline]

Give the number of sites.

Definition at line 199 of file p_queue.hh.

Referenced by mln::p_queue< P >::has(), mln::p_queue< P >::memory_size(), and mln::p_queue< P >::operator[]().

template<typename P >

const P & mln::p_queue< P >::operator[]

(

unsigned

i

)

const [inline]

Return the i-th site.

Definition at line 252 of file p_queue.hh.

References mln::p_queue< P >::nsites().

template<typename P >

void mln::p_queue< P >::pop

(

)

[inline]

Pop (remove) the front site p from the queue; p is the least recently inserted site.

Definition at line 215 of file p_queue.hh.

Referenced by mln::p_queue< P >::pop_front(), and mln::geom::impl::seeds2tiling().

template<typename P >

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.

Definition at line 233 of file p_queue.hh.

References mln::p_queue< P >::front(), and mln::p_queue< P >::pop().

template<typename P >

void mln::p_queue< P >::push

(

const P &

p

)

[inline]

Push a site p in the queue.

Definition at line 207 of file p_queue.hh.

Referenced by mln::p_queue< P >::insert(), and mln::geom::impl::seeds2tiling().

template<typename P >

const std::deque< P > & mln::p_queue< P >::std_deque

(

)

const [inline]

Return the corresponding std::deque of sites.

Definition at line 269 of file p_queue.hh.