Public Types | Public Member Functions

fst::ShortestFirstQueue< S, C, update > Class Template Reference

#include <fst/queue.h>

Inherits fst::QueueBase< S >.

Collaboration diagram for fst::ShortestFirstQueue< S, C, update >:
Collaboration graph
[legend]

List of all members.

Public Types

typedef S StateId
typedef C Compare

Public Member Functions

 ShortestFirstQueue (C comp)
StateId Head () const
void Enqueue (StateId s)
void Dequeue ()
void Update (StateId s)
bool Empty () const
void Clear ()

Detailed Description

template<typename S, typename C, bool update = true>
class fst::ShortestFirstQueue< S, C, update >

Shortest-first queue discipline, templated on the StateId and comparison function object. Comparison function object COMP is used to compare two StateIds. If a (single) state's order changes, it can be reordered in the queue with a call to Update(). If 'update == false', call to Update() does not reorder the queue.

Definition at line 207 of file queue.h.


Member Typedef Documentation

template<typename S, typename C, bool update = true>
typedef C fst::ShortestFirstQueue< S, C, update >::Compare

Definition at line 210 of file queue.h.

template<typename S, typename C, bool update = true>
typedef S fst::ShortestFirstQueue< S, C, update >::StateId

Reimplemented from fst::QueueBase< S >.

Definition at line 209 of file queue.h.


Constructor & Destructor Documentation

template<typename S, typename C, bool update = true>
fst::ShortestFirstQueue< S, C, update >::ShortestFirstQueue ( comp  )  [inline]

Definition at line 212 of file queue.h.


Member Function Documentation

template<typename S, typename C, bool update = true>
void fst::ShortestFirstQueue< S, C, update >::Clear (  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 246 of file queue.h.

template<typename S, typename C, bool update = true>
void fst::ShortestFirstQueue< S, C, update >::Dequeue (  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 227 of file queue.h.

template<typename S, typename C, bool update = true>
bool fst::ShortestFirstQueue< S, C, update >::Empty (  )  const [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 244 of file queue.h.

template<typename S, typename C, bool update = true>
void fst::ShortestFirstQueue< S, C, update >::Enqueue ( StateId  s  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 217 of file queue.h.

template<typename S, typename C, bool update = true>
StateId fst::ShortestFirstQueue< S, C, update >::Head (  )  const [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 215 of file queue.h.

template<typename S, typename C, bool update = true>
void fst::ShortestFirstQueue< S, C, update >::Update ( StateId  s  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 234 of file queue.h.


The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines