estar::Queue Class Reference

#include <Queue.hpp>

List of all members.

---

Detailed Description

Wavefront propagation queue.

Sorted by ascending key, used (mainly) by Algorithm.

Public Member Functions
bool	IsEmpty () const
vertex_t	Pop (flag_map_t &flag_map)
void	Requeue (vertex_t vertex, flag_map_t &flag_map, const value_map_t &value_map, const rhs_map_t &rhs_map)
	Note: flag_map has to reflect the actual presence of vertex in queue
void	Clear ()
bool	VitaminB (vertex_t vertex)
	For debugging: Puts the vertex (if present) to the top of the queue, returns true on success.
const queue_t &	Get () const
const queue_map_t &	GetMap () const
Private Member Functions
void	DoDequeue (vertex_t vertex, queue_t::iterator iq)
	Note: WARNING doesn't update m_map.
Private Attributes
queue_t	m_queue
queue_map_t	m_map

---

Member Function Documentation

bool estar::Queue::IsEmpty

(

)

const [inline]

vertex_t estar::Queue::Pop

(

flag_map_t &

flag_map

)

void estar::Queue::Requeue	(	vertex_t	vertex,
		flag_map_t &	flag_map,
		const value_map_t &	value_map,
		const rhs_map_t &	rhs_map
	)

Note:

flag_map has to reflect the actual presence of vertex in queue

void estar::Queue::Clear

(

)

bool estar::Queue::VitaminB

(

vertex_t

vertex

)

For debugging: Puts the vertex (if present) to the top of the queue, returns true on success.

If you then call check_queue(), it will fail... should only be done just prior to Pop().

const queue_t& estar::Queue::Get

(

)

const [inline]

const queue_map_t& estar::Queue::GetMap

(

)

const [inline]

void estar::Queue::DoDequeue	(	vertex_t	vertex,
		queue_t::iterator	iq
	)			[private]

Note:

WARNING doesn't update m_map.

---

Member Data Documentation

queue_t estar::Queue::m_queue [private]

queue_map_t estar::Queue::m_map [private]

---

The documentation for this class was generated from the following files:

• estar/Queue.hpp
• estar/Queue.cpp

---

E* Interpolated Graph Replanner Wed Dec 12 18:55:50 2007