HomeSort by relevance Sort by last modified time
    Searched refs:ComposeFst (Results 1 - 4 of 4) sorted by null

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
difference.h 40 // Complexity: same as ComposeFst.
42 // Caveats: same as ComposeFst.
44 class DifferenceFst : public ComposeFst<A> {
46 using ComposeFst<A>::Impl;
54 : ComposeFst<A>(fst1,
68 : ComposeFst<A>(fst1,
80 : ComposeFst<A>(fst) {}
91 : public StateIterator< ComposeFst<A> > {
94 : StateIterator< ComposeFst<A> >(fst) {}
101 : public ArcIterator< ComposeFst<A> >
    [all...]
intersect.h 37 // Complexity: same as ComposeFst.
39 // Caveats: same as ComposeFst.
41 class IntersectFst : public ComposeFst<A> {
43 using ComposeFst<A>::Impl;
50 : ComposeFst<A>(fst1, fst2) {
62 : ComposeFst<A>(fst1, fst2, ComposeFstOptions<T>(opts)) {
71 IntersectFst(const IntersectFst<A> &fst) : ComposeFst<A>(fst) {}
82 : public StateIterator< ComposeFst<A> > {
85 : StateIterator< ComposeFst<A> >(fst) {}
92 : public ArcIterator< ComposeFst<A> >
    [all...]
fst-decl.h 41 template <class A> class ComposeFst;
65 typedef ComposeFst<StdArc> StdComposeFst;
compose.h 84 // Abstract base for the implementation of delayed ComposeFst. The
115 LOG(FATAL) << "ComposeFst: output symbol table of 1st argument "
268 // (i.e. states of the ComposeFst). Main optimization: due to the
359 LOG(FATAL) << "ComposeFst: 1st argument not output label "
368 LOG(FATAL) << "ComposeFst: 2nd argument not input label "
380 << "ComposeFst: More than one special symbol used in composition";
406 LOG(FATAL) << "ComposeFst: 1st argument not output label sorted "
670 // - ComposeFst does not trim its output (since it is a delayed operation).
681 class ComposeFst : public Fst<A> {
683 friend class ArcIterator< ComposeFst<A> >
    [all...]

Completed in 310 milliseconds