Home
last modified time | relevance | path

Searched refs:VectorFst (Results 1 – 11 of 11) sorted by relevance

/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dvector-fst.h31 template <class A> class VectorFst; variable
186 friend class MutableArcIterator< VectorFst<A> >;
453 class VectorFst : public MutableFst<A> {
455 friend class StateIterator< VectorFst<A> >;
456 friend class ArcIterator< VectorFst<A> >;
457 friend class MutableArcIterator< VectorFst<A> >;
463 VectorFst() : impl_(new VectorFstImpl<A>) {} in VectorFst() function
465 VectorFst(const VectorFst<A> &fst) : MutableFst<A>(fst), impl_(fst.impl_) { in VectorFst() function
468 explicit VectorFst(const Fst<A> &fst) : impl_(new VectorFstImpl<A>(fst)) {} in VectorFst() function
470 virtual ~VectorFst() { if (!impl_->DecrRefCount()) delete impl_; } in ~VectorFst()
[all …]
Dfst.cpp43 REGISTER_FST(VectorFst, StdArc);
44 REGISTER_FST(VectorFst, LogArc);
Dfst-decl.h37 template <class A> class VectorFst; variable
61 typedef VectorFst<StdArc> StdVectorFst;
Dequivalent.h128 VectorFst<Arc> efst1(fst1); in Equivalent()
129 VectorFst<Arc> efst2(fst2); in Equivalent()
Drational.h139 VectorFst<A> afst; in AddUnion()
155 VectorFst<A> afst; in AddConcat()
177 VectorFst<A> rfst_; // rational topology machine; uses neg. nonterminals
Depsnormalize.h52 VectorFst< GallicArc<Arc, STRING_RIGHT_RESTRICT> > gfst;
Dpush.h67 VectorFst< GallicArc<Arc, stype> > gfst; in Push()
Dminimize.h281 VectorFst<RevA> Tr_;
521 VectorFst< GallicArc<A, STRING_LEFT> > gfst;
Dshortest-distance.h246 VectorFst<ReverseArc> rfst;
Dshortest-path.h261 VectorFst<ReverseArc> rfst; in ShortestPath()
/external/srec/tools/grxmlcompile/
Dfst-io.h283 const VectorFst<A> &Fst() const { return fst_; } in Fst()
350 VectorFst<A> fst_;