Home
last modified time | relevance | path

Searched refs:Arc (Results 1 – 25 of 140) sorted by relevance

123456

/external/openfst/src/include/fst/script/
Dfstscript.h79 template<class Arc>
89 REGISTER_FST_OPERATION(ArcSort, Arc, ArcSortArgs); in RegisterBatch1()
90 REGISTER_FST_OPERATION(Closure, Arc, ClosureArgs); in RegisterBatch1()
91 REGISTER_FST_OPERATION(CompileFst, Arc, FstCompileArgs); in RegisterBatch1()
92 REGISTER_FST_OPERATION(Compose, Arc, ComposeArgs1); in RegisterBatch1()
93 REGISTER_FST_OPERATION(Compose, Arc, ComposeArgs2); in RegisterBatch1()
94 REGISTER_FST_OPERATION(Concat, Arc, ConcatArgs1); in RegisterBatch1()
95 REGISTER_FST_OPERATION(Concat, Arc, ConcatArgs2); in RegisterBatch1()
96 REGISTER_FST_OPERATION(Connect, Arc, MutableFstClass); in RegisterBatch1()
97 REGISTER_FST_OPERATION(Convert, Arc, ConvertArgs); in RegisterBatch1()
[all …]
Dshortest-distance.h57 template<class Queue, class Arc, class ArcFilter>
60 static Queue *Construct(const Fst<Arc> &, in Construct()
61 const vector<typename Arc::Weight> *) { in Construct()
68 template<class Arc, class ArcFilter>
69 struct QueueConstructor<AutoQueue<typename Arc::StateId>, Arc, ArcFilter> {
71 static AutoQueue<typename Arc::StateId> *Construct(
72 const Fst<Arc> &fst,
73 const vector<typename Arc::Weight> *distance) {
74 return new AutoQueue<typename Arc::StateId>(fst, distance, ArcFilter());
78 template<class Arc, class ArcFilter>
[all …]
Dfst-class.h78 template<class Arc>
81 explicit FstClassImpl(Fst<Arc> *impl,
85 explicit FstClassImpl(const Fst<Arc> &impl) : impl_(impl.Copy()) { } in FstClassImpl()
88 return Arc::Type(); in ArcType()
96 return Arc::Weight::Type(); in WeightType()
109 static_cast<MutableFst<Arc> *>(impl_)->SetInputSymbols(is); in SetInputSymbols()
114 static_cast<MutableFst<Arc> *>(impl_)->SetOutputSymbols(os); in SetOutputSymbols()
131 Fst<Arc> *GetImpl() const { return impl_; } in GetImpl()
133 Fst<Arc> *GetImpl() { return impl_; } in GetImpl()
136 return new FstClassImpl<Arc>(impl_); in Copy()
[all …]
Dprune.h78 template<class Arc>
80 MutableFst<Arc> *ofst = args->arg1->GetMutableFst<Arc>(); in Prune()
82 typedef typename Arc::Weight Weight; in Prune()
83 typedef typename Arc::StateId StateId; in Prune()
85 fst::PruneOptions<Arc, AnyArcFilter<Arc> > opts = in Prune()
86 ConvertPruneOptions<Arc>(args->arg2); in Prune()
95 template<class Arc>
97 const Fst<Arc>& ifst = *(args->arg1.GetFst<Arc>()); in Prune()
98 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); in Prune()
100 fst::PruneOptions<Arc, AnyArcFilter<Arc> > opts = in Prune()
[all …]
Drmepsilon.h64 template<class Arc>
65 void RmEpsilonHelper(MutableFst<Arc> *fst, in RmEpsilonHelper()
66 vector<typename Arc::Weight> *distance, in RmEpsilonHelper()
68 typedef typename Arc::StateId StateId; in RmEpsilonHelper()
69 typedef typename Arc::Weight Weight; in RmEpsilonHelper()
71 typename Arc::Weight weight_thresh = in RmEpsilonHelper()
76 AutoQueue<StateId> queue(*fst, distance, EpsilonArcFilter<Arc>()); in RmEpsilonHelper()
77 fst::RmEpsilonOptions<Arc, AutoQueue<StateId> > ropts( in RmEpsilonHelper()
85 fst::RmEpsilonOptions<Arc, FifoQueue<StateId> > ropts( in RmEpsilonHelper()
93 fst::RmEpsilonOptions<Arc, LifoQueue<StateId> > ropts( in RmEpsilonHelper()
[all …]
Dshortest-path.h56 template<class Arc>
58 const Fst<Arc> &ifst = *(args->arg1.GetFst<Arc>()); in ShortestPath()
59 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); in ShortestPath()
61 typedef typename Arc::StateId StateId; in ShortestPath()
62 typedef typename Arc::Weight Weight; in ShortestPath()
63 typedef AnyArcFilter<Arc> ArcFilter; in ShortestPath()
65 vector<typename Arc::Weight> weights; in ShortestPath()
66 typename Arc::Weight weight_threshold = in ShortestPath()
72 Queue *queue = QueueConstructor<Queue, Arc, in ShortestPath()
74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( in ShortestPath()
[all …]
Ddifference.h31 template<class Arc>
33 const Fst<Arc> &ifst1 = *(args->arg1.GetFst<Arc>()); in Difference()
34 const Fst<Arc> &ifst2 = *(args->arg2.GetFst<Arc>()); in Difference()
35 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); in Difference()
43 template<class Arc>
45 const Fst<Arc> &ifst1 = *(args->arg1.GetFst<Arc>()); in Difference()
46 const Fst<Arc> &ifst2 = *(args->arg2.GetFst<Arc>()); in Difference()
47 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); in Difference()
Dcompose.h30 template<class Arc>
32 const Fst<Arc> &ifst1 = *(args->arg1.GetFst<Arc>()); in Compose()
33 const Fst<Arc> &ifst2 = *(args->arg2.GetFst<Arc>()); in Compose()
34 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); in Compose()
44 template<class Arc>
46 const Fst<Arc> &ifst1 = *(args->arg1.GetFst<Arc>()); in Compose()
47 const Fst<Arc> &ifst2 = *(args->arg2.GetFst<Arc>()); in Compose()
48 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); in Compose()
Dintersect.h31 template<class Arc>
33 const Fst<Arc> &ifst1 = *(args->arg1.GetFst<Arc>()); in Intersect()
34 const Fst<Arc> &ifst2 = *(args->arg2.GetFst<Arc>()); in Intersect()
35 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); in Intersect()
43 template<class Arc>
45 const Fst<Arc> &ifst1 = *(args->arg1.GetFst<Arc>()); in Intersect()
46 const Fst<Arc> &ifst2 = *(args->arg2.GetFst<Arc>()); in Intersect()
47 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); in Intersect()
Drandequivalent.h34 template<class Arc>
36 const Fst<Arc> &fst1 = *(args->args.arg1.GetFst<Arc>()); in RandEquivalent()
37 const Fst<Arc> &fst2 = *(args->args.arg2.GetFst<Arc>()); in RandEquivalent()
52 template<class Arc>
54 const Fst<Arc> &fst1 = *(args->args.arg1.GetFst<Arc>()); in RandEquivalent()
55 const Fst<Arc> &fst2 = *(args->args.arg2.GetFst<Arc>()); in RandEquivalent()
60 UniformArcSelector<Arc> arc_selector(seed); in RandEquivalent()
61 RandGenOptions< UniformArcSelector<Arc> > in RandEquivalent()
67 FastLogProbArcSelector<Arc> arc_selector(seed); in RandEquivalent()
68 RandGenOptions< FastLogProbArcSelector<Arc> > in RandEquivalent()
[all …]
/external/openfst/src/test/
Dalgo_test.h62 template <class Arc, class WeightGenerator>
65 typedef typename Arc::Label Label;
66 typedef typename Arc::StateId StateId;
67 typedef typename Arc::Weight Weight;
69 WeightedTester(int seed, const Fst<Arc> &zero_fst, const Fst<Arc> &one_fst, in WeightedTester()
70 const Fst<Arc> &univ_fst, WeightGenerator *weight_generator) in WeightedTester()
74 void Test(const Fst<Arc> &T1, const Fst<Arc> &T2, const Fst<Arc> &T3) { in Test()
85 void TestRational(const Fst<Arc> &T1, const Fst<Arc> &T2, in TestRational()
86 const Fst<Arc> &T3) { in TestRational()
90 VectorFst<Arc> U1(T1); in TestRational()
[all …]
/external/openfst/src/include/fst/
Dpush.h43 template <class Arc>
44 typename Arc::Weight ComputeTotalWeight( in ComputeTotalWeight()
45 const Fst<Arc> &fst, in ComputeTotalWeight()
46 const vector<typename Arc::Weight> &distance, in ComputeTotalWeight()
50 distance[fst.Start()] : Arc::Weight::Zero(); in ComputeTotalWeight()
52 typename Arc::Weight sum = Arc::Weight::Zero(); in ComputeTotalWeight()
53 for (typename Arc::StateId s = 0; s < distance.size(); ++s) in ComputeTotalWeight()
61 template <class Arc>
62 void RemoveWeight(MutableFst<Arc> *fst, typename Arc::Weight w, bool at_final) { in RemoveWeight()
63 if ((w == Arc::Weight::One()) || (w == Arc::Weight::Zero())) in RemoveWeight()
[all …]
Dreplace-util.h43 template <class Arc>
44 void Replace(const vector<pair<typename Arc::Label, const Fst<Arc>* > >&,
45 MutableFst<Arc> *, typename Arc::Label, bool);
54 template <class Arc>
57 typedef typename Arc::Label Label;
58 typedef typename Arc::Weight Weight;
59 typedef typename Arc::StateId StateId;
61 typedef pair<Label, const Fst<Arc>*> FstPair;
62 typedef pair<Label, MutableFst<Arc>*> MutableFstPair;
74 ReplaceUtil(const vector<const Fst<Arc> *> &fst_array,
[all …]
Drandequivalent.h43 template<class Arc, class ArcSelector>
44 bool RandEquivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2,
48 typedef typename Arc::Weight Weight;
61 ILabelCompare<Arc> icomp;
62 OLabelCompare<Arc> ocomp;
63 VectorFst<Arc> sfst1(fst1);
64 VectorFst<Arc> sfst2(fst2);
72 VectorFst<Arc> path;
73 const Fst<Arc> &fst = rand() % 2 ? sfst1 : sfst2;
76 VectorFst<Arc> ipath(path);
[all …]
Dlookahead-matcher.h135 typedef A Arc; typedef
148 bool LookAheadFst(const Fst<Arc> &fst, StateId s) { in LookAheadFst()
154 bool LookAheadPrefix(Arc *arc) const { in LookAheadPrefix()
163 virtual void InitLookAheadFst(const Fst<Arc>& fst, bool copy = false) = 0;
168 void SetLookAheadPrefix(const Arc &arc) { prefix_arc_ = arc; } in SetLookAheadPrefix()
174 virtual bool LookAheadFst_(const Fst<Arc> &fst,
178 Arc prefix_arc_; // Look-ahead prefix arc
185 : public LookAheadMatcherBase<typename M::FST::Arc> {
188 typedef typename M::Arc Arc; typedef
189 typedef typename Arc::StateId StateId;
[all …]
Dshortest-distance.h38 template <class Arc, class Queue, class ArcFilter>
40 typedef typename Arc::StateId StateId;
71 template<class Arc, class Queue, class ArcFilter>
74 typedef typename Arc::StateId StateId;
75 typedef typename Arc::Weight Weight;
78 const Fst<Arc> &fst, in ShortestDistanceState()
80 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, in ShortestDistanceState() argument
96 const Fst<Arc> &fst_;
115 template <class Arc, class Queue, class ArcFilter>
116 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( in ShortestDistance()
[all …]
Dequivalent.h54 template <class Arc>
56 typedef typename Arc::StateId StateId;
57 typedef typename Arc::Weight Weight;
83 static bool IsFinal(const Fst<Arc> &fa, MappedId s) { in IsFinal()
101 template <class Arc> const
102 typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kDeadState;
104 template <class Arc> const
105 typename EquivalenceUtil<Arc>::MappedId EquivalenceUtil<Arc>::kInvalidId;
129 template <class Arc>
130 bool Equivalent(const Fst<Arc> &fst1,
[all …]
Dconcat.h46 template<class Arc>
47 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { in Concat()
48 typedef typename Arc::StateId StateId; in Concat()
49 typedef typename Arc::Label Label; in Concat()
50 typedef typename Arc::Weight Weight; in Concat()
75 for (StateIterator< Fst<Arc> > siter2(fst2); in Concat()
82 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); in Concat()
85 Arc arc = aiter.Value(); in Concat()
97 fst1->AddArc(s1, Arc(0, 0, final, start2 + numstates1)); in Concat()
112 template<class Arc>
[all …]
Drmepsilon.h48 template <class Arc, class Queue>
50 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
52 typedef typename Arc::StateId StateId;
53 typedef typename Arc::Weight Weight;
62 : ShortestDistanceOptions< Arc, Queue, EpsilonArcFilter<Arc> >(
63 q, EpsilonArcFilter<Arc>(), kNoStateId, d),
70 template <class Arc, class Queue>
73 typedef typename Arc::Label Label;
74 typedef typename Arc::StateId StateId;
75 typedef typename Arc::Weight Weight;
[all …]
Dshortest-path.h39 template <class Arc, class Queue, class ArcFilter>
41 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> {
42 typedef typename Arc::StateId StateId;
43 typedef typename Arc::Weight Weight;
60 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d),
77 template<class Arc, class Queue, class ArcFilter>
78 void SingleShortestPath(const Fst<Arc> &ifst, in SingleShortestPath()
79 MutableFst<Arc> *ofst, in SingleShortestPath()
80 vector<typename Arc::Weight> *distance, in SingleShortestPath()
81 ShortestPathOptions<Arc, Queue, ArcFilter> &opts) { in SingleShortestPath() argument
[all …]
Ddfs-visit.h73 template <class Arc>
75 typedef typename Arc::StateId StateId;
77 DfsState(const Fst<Arc> &fst, StateId s): state_id(s), arc_iter(fst, s) {} in DfsState()
80 ArcIterator< Fst<Arc> > arc_iter; // and its corresponding arcs
91 template <class Arc, class V, class ArcFilter>
92 void DfsVisit(const Fst<Arc> &fst, V *visitor, ArcFilter filter) { in DfsVisit()
93 typedef typename Arc::StateId StateId; in DfsVisit()
104 stack<DfsState<Arc> *> state_stack; // DFS execution stack in DfsVisit()
114 StateIterator< Fst<Arc> > siter(fst); in DfsVisit()
122 state_stack.push(new DfsState<Arc>(fst, root)); in DfsVisit()
[all …]
Depsnormalize.h51 template <class Arc>
52 void EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
54 VectorFst< GallicArc<Arc, STRING_RIGHT_RESTRICT> > gfst;
56 ArcMap(ifst, &gfst, ToGallicMapper<Arc, STRING_RIGHT_RESTRICT>());
58 ArcMap(InvertFst<Arc>(ifst), &gfst,
59 ToGallicMapper<Arc, STRING_RIGHT_RESTRICT>());
61 FactorWeightFst< GallicArc<Arc, STRING_RIGHT_RESTRICT>,
62 GallicFactor<typename Arc::Label,
63 typename Arc::Weight, STRING_RIGHT_RESTRICT> >
65 ArcMap(fwfst, ofst, FromGallicMapper<Arc, STRING_RIGHT_RESTRICT>());
/external/openfst/src/include/fst/extensions/pdt/
Dshortest-path.h40 template <class Arc, class Queue>
65 template <class Arc>
70 typedef typename Arc::StateId StateId;
71 typedef typename Arc::Weight Weight;
72 typedef typename Arc::Label Label;
216 static const Arc kNoArc;
300 template<class Arc>
301 void PdtShortestPathData<Arc>::GC(StateId start) { in GC()
347 template<class Arc> const Arc PdtShortestPathData<Arc>::kNoArc
348 = Arc(kNoLabel, kNoLabel, Weight::Zero(), kNoStateId);
[all …]
Dpdtscript.h54 template<class Arc>
56 const Fst<Arc> &ifst1 = *(args->arg1.GetFst<Arc>()); in PdtCompose()
57 const Fst<Arc> &ifst2 = *(args->arg2.GetFst<Arc>()); in PdtCompose()
58 MutableFst<Arc> *ofst = args->arg4->GetMutableFst<Arc>(); in PdtCompose()
60 vector<pair<typename Arc::Label, typename Arc::Label> > parens( in PdtCompose()
98 template<class Arc>
100 const Fst<Arc> &fst = *(args->arg1.GetFst<Arc>()); in PdtExpand()
101 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); in PdtExpand()
103 vector<pair<typename Arc::Label, typename Arc::Label> > parens( in PdtExpand()
110 ExpandOptions<Arc>( in PdtExpand()
[all …]
Dcompose.h45 typedef typename M::Arc Arc; typedef
46 typedef typename Arc::StateId StateId;
47 typedef typename Arc::Label Label;
48 typedef typename Arc::Weight Weight;
93 const Arc& Value() const { in Value()
176 mutable Arc loop_; // For non-consuming symbols
281 typedef typename F::Arc Arc; typedef
282 typedef typename Arc::StateId StateId;
283 typedef typename Arc::Label Label;
284 typedef typename Arc::Weight Weight;
[all …]

123456