Home
last modified time | relevance | path

Searched refs:ArcFilter (Results 1 – 8 of 8) sorted by relevance

/external/openfst/src/include/fst/script/
Dshortest-path.h63 typedef AnyArcFilter<Arc> ArcFilter; in ShortestPath() typedef
73 ArcFilter>::Construct(ifst, &weights); in ShortestPath()
74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( in ShortestPath()
75 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
85 ArcFilter>::Construct(ifst, &weights); in ShortestPath()
86 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( in ShortestPath()
87 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
97 ArcFilter >::Construct(ifst, &weights); in ShortestPath()
98 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( in ShortestPath()
99 queue, ArcFilter(), opts.nshortest, opts.unique, in ShortestPath()
[all …]
Dshortest-distance.h57 template<class Queue, class Arc, class ArcFilter>
68 template<class Arc, class ArcFilter>
69 struct QueueConstructor<AutoQueue<typename Arc::StateId>, Arc, ArcFilter> {
74 return new AutoQueue<typename Arc::StateId>(fst, distance, ArcFilter());
78 template<class Arc, class ArcFilter>
81 Arc, ArcFilter> {
91 template<class Arc, class ArcFilter>
92 struct QueueConstructor<TopOrderQueue<typename Arc::StateId>, Arc, ArcFilter> {
96 return new TopOrderQueue<typename Arc::StateId>(fst, ArcFilter());
/external/openfst/src/include/fst/
Dshortest-distance.h38 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, in ShortestDistanceState()
99 ArcFilter arc_filter_;
115 template <class Arc, class Queue, class ArcFilter>
116 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( in ShortestDistance()
243 template<class Arc, class Queue, class ArcFilter>
247 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) { in ShortestDistance()
[all …]
Dprune.h34 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) { in Prune()
216 template <class Arc, class ArcFilter>
219 const PruneOptions<Arc, ArcFilter> &opts) { in Prune()
Dshortest-path.h39 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) { in SingleShortestPath()
412 template<class Arc, class Queue, class ArcFilter>
415 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) { in ShortestPath()
Dqueue.h320 template <class Arc, class ArcFilter>
321 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter) in TopOrderQueue()
542 template <class Arc, class ArcFilter>
544 ArcFilter filter) : QueueBase<S>(AUTO_QUEUE) { in AutoQueue()
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, in SccQueueType()
Ddfs-visit.h91 template <class Arc, class V, class ArcFilter>
92 void DfsVisit(const Fst<Arc> &fst, V *visitor, ArcFilter filter) { in DfsVisit()
Dvisit.h68 template <class Arc, class V, class Q, class ArcFilter>
69 void Visit(const Fst<Arc> &fst, V *visitor, Q *queue, ArcFilter filter) { in Visit()