/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | dfs-visit.h | 75 // and contains any return data. ArcFilter determines arcs that are considered. 76 template <class Arc, class V, class ArcFilter> 77 void DfsVisit(const Fst<Arc> &fst, V *visitor, ArcFilter filter) {
|
H A D | prune.h | 28 template <class A, class ArcFilter> 36 ArcFilter filter; 44 PruneOptions(const Weight& t, ArcFilter f, vector<Weight> *id = 0, 55 template <class Arc, class ArcFilter> 57 const PruneOptions<Arc, ArcFilter> &opts) { 140 template <class Arc, class ArcFilter> 143 const PruneOptions<Arc, ArcFilter> &opts) {
|
H A D | queue.h | 289 template <class Arc, class ArcFilter> 291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter) 504 template <class Arc, class ArcFilter> 506 ArcFilter filter) : QueueBase<S>(AUTO_QUEUE) { 615 template <class Arc, class ArcFilter, class Less> 619 ArcFilter filter, Less *less, 645 template <class A, class ArcFilter, class Less> 649 ArcFilter filter, Less *less,
|
H A D | shortest-distance.h | 33 template <class Arc, class Queue, class ArcFilter> 38 ArcFilter arc_filter; // Arc filter (e.g., limit to only epsilon graph) 42 ShortestDistanceOptions(Queue *q, ArcFilter filt, StateId src = kNoStateId, 54 template<class Arc, class Queue, class ArcFilter> 63 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, 81 ArcFilter arc_filter_; 93 template <class Arc, class Queue, class ArcFilter> 94 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( 198 template<class Arc, class Queue, class ArcFilter> 202 const ShortestDistanceOptions<Arc, Queue, ArcFilter> [all...] |
H A D | shortest-path.h | 32 template <class Arc, class Queue, class ArcFilter> 34 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> { 42 ShortestPathOptions(Queue *q, ArcFilter filt, size_t n = 1, bool u = false, 44 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d), 60 template<class Arc, class Queue, class ArcFilter> 64 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) { 227 template<class Arc, class Queue, class ArcFilter> 230 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
|
/external/openfst/src/include/fst/ |
H A D | dfs-visit.h | 85 // actions and contains any return data. ArcFilter determines arcs 91 template <class Arc, class V, class ArcFilter> 92 void DfsVisit(const Fst<Arc> &fst, V *visitor, ArcFilter filter) {
|
H A D | prune.h | 34 template <class A, class ArcFilter> 45 ArcFilter filter; 52 explicit PruneOptions(const Weight& w, StateId s, ArcFilter f, 99 template <class Arc, class ArcFilter> 101 const PruneOptions<Arc, ArcFilter> &opts) { 216 template <class Arc, class ArcFilter> 219 const PruneOptions<Arc, ArcFilter> &opts) {
|
H A D | queue.h | 320 template <class Arc, class ArcFilter> 321 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter) 542 template <class Arc, class ArcFilter> 544 ArcFilter filter) : QueueBase<S>(AUTO_QUEUE) { 652 template <class Arc, class ArcFilter, class Less> 656 ArcFilter filter, Less *less, 687 template <class A, class ArcFilter, class Less> 691 ArcFilter filter, Less *less,
|
H A D | shortest-distance.h | 38 template <class Arc, class Queue, class ArcFilter> 43 ArcFilter arc_filter; // Arc filter (e.g., limit to only epsilon graph) 56 ShortestDistanceOptions(Queue *q, ArcFilter filt, StateId src = kNoStateId, 71 template<class Arc, class Queue, class ArcFilter> 80 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, 99 ArcFilter arc_filter_; 115 template <class Arc, class Queue, class ArcFilter> 116 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( 243 template<class Arc, class Queue, class ArcFilter> 247 const ShortestDistanceOptions<Arc, Queue, ArcFilter> [all...] |
H A D | shortest-path.h | 39 template <class Arc, class Queue, class ArcFilter> 41 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> { 56 ShortestPathOptions(Queue *q, ArcFilter filt, size_t n = 1, bool u = false, 60 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d), 77 template<class Arc, class Queue, class ArcFilter> 81 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) { 412 template<class Arc, class Queue, class ArcFilter> 415 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) {
|
H A D | visit.h | 63 // determines actions and contains any return data. ArcFilter 68 template <class Arc, class V, class Q, class ArcFilter> 69 void Visit(const Fst<Arc> &fst, V *visitor, Q *queue, ArcFilter filter) {
|
/external/openfst/src/include/fst/script/ |
H A D | shortest-distance.h | 57 template<class Queue, class Arc, class ArcFilter> 59 // template<class Arc, class ArcFilter> 68 template<class Arc, class ArcFilter> 69 struct QueueConstructor<AutoQueue<typename Arc::StateId>, Arc, ArcFilter> { 70 // template<class Arc, class ArcFilter> 74 return new AutoQueue<typename Arc::StateId>(fst, distance, ArcFilter()); 78 template<class Arc, class ArcFilter> 81 Arc, ArcFilter> { 82 // template<class Arc, class ArcFilter> 91 template<class Arc, class ArcFilter> [all...] |
H A D | shortest-path.h | 63 typedef AnyArcFilter<Arc> ArcFilter; typedef 73 ArcFilter>::Construct(ifst, &weights); 74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( 75 queue, ArcFilter(), opts.nshortest, opts.unique, 85 ArcFilter>::Construct(ifst, &weights); 86 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( 87 queue, ArcFilter(), opts.nshortest, opts.unique, 97 ArcFilter >::Construct(ifst, &weights); 98 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( 99 queue, ArcFilter(), opt [all...] |