HomeSort by relevance Sort by last modified time
    Searched refs:ComposeFst (Results 1 - 10 of 10) 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...]
  /external/openfst/src/include/fst/
intersect.h 54 // Complexity: same as ComposeFst.
56 // Caveats: same as ComposeFst.
58 class IntersectFst : public ComposeFst<A> {
60 using ComposeFst<A>::CreateBase;
61 using ComposeFst<A>::CreateBase1;
62 using ComposeFst<A>::Properties;
95 ComposeFst<A>(fst, safe) {}
107 : public StateIterator< ComposeFst<A> > {
110 : StateIterator< ComposeFst<A> >(fst) {}
117 : public ArcIterator< ComposeFst<A> >
    [all...]
difference.h 56 // Complexity: same as ComposeFst.
58 // Caveats: same as ComposeFst.
60 class DifferenceFst : public ComposeFst<A> {
65 using ComposeFst<A>::CreateBase1;
111 : ComposeFst<A>(fst, safe) {}
123 : public StateIterator< ComposeFst<A> > {
126 : StateIterator< ComposeFst<A> >(fst) {}
133 : public ArcIterator< ComposeFst<A> > {
138 : ArcIterator< ComposeFst<A> >(fst, s) {}
compose.h 43 // objects; in that case, ComposeFst takes their ownership. This
72 // objects; in that case, ComposeFst takes their ownership. This
126 VLOG(2) << "ComposeFst(" << this << "): Begin";
130 FSTERROR() << "ComposeFst: output symbol table of 1st argument "
236 VLOG(2) << "ComposeFst(" << this
402 VLOG(2) << "ComposeFst(" << this << "): Match type: "
415 VLOG(2) << "ComposeFst(" << this << "): Initialized";
425 FSTERROR() << "ComposeFst: only one argument can require matching.";
429 FSTERROR() << "ComposeFst: 1st argument requires matching but cannot.";
435 FSTERROR() << "ComposeFst: 2nd argument requires matching but cannot."
    [all...]
fst-decl.h 56 template <class A> class ComposeFst;
99 typedef ComposeFst<StdArc> StdComposeFst;
  /external/openfst/src/test/
algo_test.h 470 ComposeFst<Arc> C1(S1, S2);
472 ComposeFst<Arc> C2(C1, S3);
473 ComposeFst<Arc> C3(S2, S3);
474 ComposeFst<Arc> C4(S1, C3);
482 ComposeFst<Arc> C1(S1, U1);
484 ComposeFst<Arc> C2(S1, S2);
485 ComposeFst<Arc> C3(S1, S3);
494 ComposeFst<Arc> C1(U1, S3);
496 ComposeFst<Arc> C2(S1, S3);
497 ComposeFst<Arc> C3(S2, S3)
    [all...]
  /external/openfst/src/include/fst/extensions/pdt/
compose.h 506 *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);
529 *ofst = ComposeFst<Arc>(ifst1, ifst2, copts);

Completed in 77 milliseconds