Public Types | Public Member Functions

fst::TopOrderQueue< S > Class Template Reference

#include <fst/queue.h>

Inherits fst::QueueBase< S >.

Collaboration diagram for fst::TopOrderQueue< S >:
Collaboration graph
[legend]

List of all members.

Public Types

typedef S StateId

Public Member Functions

template<class Arc , class ArcFilter >
 TopOrderQueue (const Fst< Arc > &fst, ArcFilter filter)
 TopOrderQueue (const vector< StateId > &order)
StateId Head () const
void Enqueue (StateId s)
void Dequeue ()
void Update (StateId s)
bool Empty () const
void Clear ()

Detailed Description

template<class S>
class fst::TopOrderQueue< S >

Topological-order queue discipline, templated on the StateId. States are ordered in the queue topologically. The FST must be acyclic.

Definition at line 308 of file queue.h.


Member Typedef Documentation

template<class S>
typedef S fst::TopOrderQueue< S >::StateId

Reimplemented from fst::QueueBase< S >.

Definition at line 310 of file queue.h.


Constructor & Destructor Documentation

template<class S>
template<class Arc , class ArcFilter >
fst::TopOrderQueue< S >::TopOrderQueue ( const Fst< Arc > &  fst,
ArcFilter  filter 
) [inline]

This constructor computes the top. order. It accepts an arc filter to limit the transitions considered in that computation (e.g., only the epsilon graph).

Definition at line 317 of file queue.h.

template<class S>
fst::TopOrderQueue< S >::TopOrderQueue ( const vector< StateId > &  order  )  [inline]

This constructor is passed the top. order, useful when we know it beforehand.

Definition at line 330 of file queue.h.


Member Function Documentation

template<class S>
void fst::TopOrderQueue< S >::Clear (  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 352 of file queue.h.

template<class S>
void fst::TopOrderQueue< S >::Dequeue (  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 343 of file queue.h.

template<class S>
bool fst::TopOrderQueue< S >::Empty (  )  const [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 350 of file queue.h.

template<class S>
void fst::TopOrderQueue< S >::Enqueue ( StateId  s  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 336 of file queue.h.

template<class S>
StateId fst::TopOrderQueue< S >::Head (  )  const [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 334 of file queue.h.

template<class S>
void fst::TopOrderQueue< S >::Update ( StateId  s  )  [inline]

Reimplemented from fst::QueueBase< S >.

Definition at line 348 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