Home
last modified time | relevance | path

Searched refs:TOP_ORDER_QUEUE (Results 1 – 7 of 7) sorted by relevance

/external/openfst/src/bin/
Dfstshortestdistance.cc71 qt = fst::TOP_ORDER_QUEUE; in main()
Dfstrmepsilon.cc74 qt = fst::TOP_ORDER_QUEUE; in main()
Dfstshortestpath.cc77 qt = fst::TOP_ORDER_QUEUE; in main()
/external/openfst/src/include/fst/script/
Drmepsilon.h116 case TOP_ORDER_QUEUE: { in RmEpsilonHelper()
Dshortest-path.h130 case TOP_ORDER_QUEUE: { in ShortestPath()
Dshortest-distance.h194 case TOP_ORDER_QUEUE:
/external/openfst/src/include/fst/
Dqueue.h65 TOP_ORDER_QUEUE = 4, // Topologically-ordered queue enumerator
322 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId), in TopOrderQueue()
337 : QueueBase<S>(TOP_ORDER_QUEUE), front_(0), back_(kNoStateId), in TopOrderQueue()