Home
last modified time | relevance | path

Searched refs:fst1 (Results 1 – 9 of 9) sorted by relevance

/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dunion.h37 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { in Union() argument
46 StateId numstates1 = fst1->NumStates(); in Union()
47 bool initial_acyclic1 = fst1->Properties(kInitialAcyclic, true); in Union()
48 uint64 props1 = fst1->Properties(kFstProperties, false); in Union()
54 StateId s1 = fst1->AddState(); in Union()
56 fst1->SetFinal(s1, fst2.Final(s2)); in Union()
62 fst1->AddArc(s1, arc); in Union()
65 StateId start1 = fst1->Start(); in Union()
67 fst1->SetStart(start2); in Union()
68 fst1->SetProperties(props2, kCopyProperties); in Union()
[all …]
Dconcat.h39 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { in Concat() argument
44 StateId start1 = fst1->Start(); in Concat()
48 uint64 props1 = fst1->Properties(kFstProperties, false); in Concat()
51 StateId numstates1= fst1->NumStates(); in Concat()
56 StateId s1 = fst1->AddState(); in Concat()
58 fst1->SetFinal(s1, fst2.Final(s2)); in Concat()
64 fst1->AddArc(s1, arc); in Concat()
70 Weight final = fst1->Final(s1); in Concat()
72 fst1->SetFinal(s1, Weight::Zero()); in Concat()
74 fst1->AddArc(s1, Arc(0, 0, final, start2 + numstates1)); in Concat()
[all …]
Dequal.h28 bool Equal(const Fst<Arc> &fst1, const Fst<Arc> &fst2) { in Equal() argument
32 if (fst1.Start() != fst2.Start()) { in Equal()
37 StateIterator< Fst<Arc> > siter1(fst1); in Equal()
53 Weight final1 = fst1.Final(s1); in Equal()
62 ArcIterator< Fst<Arc> > aiter1(fst1, s1); in Equal()
106 CHECK_EQ(fst1.NumArcs(s1), fst2.NumArcs(s2)); in Equal()
107 CHECK_EQ(fst1.NumInputEpsilons(s1), fst2.NumInputEpsilons(s2)); in Equal()
108 CHECK_EQ(fst1.NumOutputEpsilons(s1), fst2.NumOutputEpsilons(s2)); in Equal()
Drational.h37 template <class A> void Union(RationalFst<A> *fst1, const Fst<A> &fst2);
38 template <class A> void Concat(RationalFst<A> *fst1, const Fst<A> &fst2);
63 void InitUnion(const Fst<A> &fst1, const Fst<A> &fst2) { in InitUnion() argument
64 uint64 props1 = fst1.Properties(kFstProperties, false); in InitUnion()
66 SetInputSymbols(fst1.InputSymbols()); in InitUnion()
67 SetOutputSymbols(fst1.OutputSymbols()); in InitUnion()
72 rfst_.SetInputSymbols(fst1.InputSymbols()); in InitUnion()
73 rfst_.SetOutputSymbols(fst1.OutputSymbols()); in InitUnion()
78 AddFst(-1, &fst1); in InitUnion()
85 void InitConcat(const Fst<A> &fst1, const Fst<A> &fst2) { in InitConcat() argument
[all …]
Dintersect.h49 IntersectFst(const Fst<A> &fst1, const Fst<A> &fst2) in IntersectFst() argument
50 : ComposeFst<A>(fst1, fst2) { in IntersectFst()
51 if (!fst1.Properties(kAcceptor, true) || !fst2.Properties(kAcceptor, true)) in IntersectFst()
53 uint64 props1 = fst1.Properties(kFstProperties, false); in IntersectFst()
60 IntersectFst(const Fst<A> &fst1, const Fst<A> &fst2, in IntersectFst() argument
62 : ComposeFst<A>(fst1, fst2, ComposeFstOptions<T>(opts)) { in IntersectFst()
63 if (!fst1.Properties(kAcceptor, true) || !fst2.Properties(kAcceptor, true)) in IntersectFst()
65 uint64 props1 = fst1.Properties(kFstProperties, false); in IntersectFst()
Ddifference.h53 DifferenceFst(const Fst<A> &fst1, const Fst<A> &fst2) in DifferenceFst() argument
54 : ComposeFst<A>(fst1, in DifferenceFst()
57 if (!fst1.Properties(kAcceptor, true)) in DifferenceFst()
59 uint64 props1 = fst1.Properties(kFstProperties, false); in DifferenceFst()
66 DifferenceFst(const Fst<A> &fst1, const Fst<A> &fst2, in DifferenceFst() argument
68 : ComposeFst<A>(fst1, in DifferenceFst()
71 if (!fst1.Properties(kAcceptor, true)) in DifferenceFst()
73 uint64 props1 = fst1.Properties(kFstProperties, false); in DifferenceFst()
Dequivalent.h113 bool Equivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2) { in Equivalent() argument
117 if (fst1.Properties(props, true) != props) { in Equivalent()
126 if ((fst1.Properties(kUnweighted , true) != kUnweighted) in Equivalent()
128 VectorFst<Arc> efst1(fst1); in Equivalent()
146 MappedId s1 = Util::MapState(fst1.Start(), FST1); in Equivalent()
157 if (Util::IsFinal(fst1, s1) != Util::IsFinal(fst2, s2)) { in Equivalent()
191 ArcIterator<Fst<Arc> > arc_iter(fst1, Util::UnMapState(s1)); in Equivalent()
220 if (Util::IsFinal(fst1, p.first) != Util::IsFinal(fst2, p.second)) { in Equivalent()
Dcompose.h105 ComposeFstImplBase(const Fst<A> &fst1, in ComposeFstImplBase() argument
108 :CacheImpl<A>(opts), fst1_(fst1.Copy()), fst2_(fst2.Copy()) { in ComposeFstImplBase()
110 uint64 props1 = fst1.Properties(kFstProperties, false); in ComposeFstImplBase()
114 if (!CompatSymbols(fst2.InputSymbols(), fst1.OutputSymbols())) in ComposeFstImplBase()
118 SetInputSymbols(fst1.InputSymbols()); in ComposeFstImplBase()
344 ComposeFstImpl(const Fst<A> &fst1, in ComposeFstImpl() argument
347 :ComposeFstImplBase<A>(fst1, fst2, opts) { in ComposeFstImpl()
349 bool osorted = fst1.Properties(kOLabelSorted, false); in ComposeFstImpl()
357 osorted = fst1.Properties(kOLabelSorted, true); in ComposeFstImpl()
373 osorted = fst1.Properties(kOLabelSorted, true); in ComposeFstImpl()
[all …]
/external/webkit/PerformanceTests/Parser/resources/
Dfinal-url-en41420 http://www.fastmetrics.com/biznet/fst1.html