HomeSort by relevance Sort by last modified time
    Searched full:ofst (Results 1 - 15 of 15) sorted by null

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
reverse.h 36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) {
41 ofst->DeleteStates();
42 ofst->SetInputSymbols(ifst.InputSymbols());
43 ofst->SetOutputSymbols(ifst.OutputSymbols());
45 StateId ostart = ofst->AddState();
46 ofst->SetStart(ostart);
53 while (ofst->NumStates() <= os)
54 ofst->AddState();
56 ofst->SetFinal(os, RevWeight::One());
61 ofst->AddArc(0, oarc)
    [all...]
randgen.h 106 int64 dest; // 'ofst' state to append
117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
125 ofst->DeleteStates();
126 ofst->SetInputSymbols(ifst.InputSymbols());
127 ofst->SetOutputSymbols(ifst.OutputSymbols());
128 ofst->SetStart(ofst->AddState());
131 nopts.dest = ofst->Start();
133 RandGen(ifst, ofst, nopts);
141 ofst->SetFinal(opts.dest, Weight::One())
    [all...]
shortest-path.h 50 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
62 MutableFst<Arc> *ofst,
68 ofst->DeleteStates();
69 ofst->SetInputSymbols(ifst.InputSymbols());
70 ofst->SetOutputSymbols(ifst.OutputSymbols());
154 s_p = ofst->AddState();
156 ofst->SetFinal(s_p, ifst.Final(f_parent));
159 ofst->AddArc(s_p, arc_parent[d]);
162 ofst->SetStart(s_p);
207 // 'ofst' contains the n-shortest paths in 'ifst'. 'distance' return
    [all...]
push.h 51 // OFST obtained from IFST by pushing weights and/or labels according
57 void Push(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, uint32 ptype) {
60 *ofst = ifst;
61 Push(ofst, rtype);
81 Map(fwfst, ofst, FromGallicMapper<Arc, stype>());
83 *ofst = ifst;
prune.h 136 // 'ofst' contains states and arcs that belong to a successful path in
142 MutableFst<Arc> *ofst,
153 ofst->DeleteStates();
192 copy[state] = ofst->AddState();
194 ofst->SetFinal(copy[state], ifst.Final(state));
215 copy[arc.nextstate] = ofst->AddState();
217 ofst->AddArc(copy[state], arc);
222 ofst->SetStart(copy[ifst.Start()]);
233 // argument. 'ofst' contains states and arcs that belong to a
239 MutableFst<Arc> *ofst,
    [all...]
epsnormalize.h 50 void EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
63 Map(fwfst, ofst, FromGallicMapper<Arc, STRING_RIGHT_RESTRICT>());
65 Invert(ofst);
difference.h 129 MutableFst<Arc> *ofst,
133 *ofst = DifferenceFst<Arc>(ifst1, ifst2, nopts);
135 Connect(ofst);
intersect.h 119 MutableFst<Arc> *ofst,
123 *ofst = IntersectFst<Arc>(ifst1, ifst2, nopts);
125 Connect(ofst);
map.h 158 void Map(const Fst<A> &ifst, MutableFst<B> *ofst, C* mapper) {
162 ofst->DeleteStates();
163 ofst->SetInputSymbols(ifst.InputSymbols());
164 ofst->SetOutputSymbols(ifst.OutputSymbols());
171 ofst->AddState();
176 superfinal = ofst->AddState();
177 ofst->SetFinal(superfinal, B::Weight::One());
182 ofst->SetStart(s);
185 ofst->AddArc(s, (*mapper)(aiter.Value()));
192 ofst->SetFinal(s, final_arc.weight)
    [all...]
synchronize.h 451 void Synchronize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) {
454 *ofst = SynchronizeFst<Arc>(ifst, opts);
compose.h     [all...]
determinize.h 710 void Determinize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
715 *ofst = DeterminizeFst<Arc>(ifst, nopts);
replace.h 675 MutableFst<Arc> *ofst, typename Arc::Label root) {
678 *ofst = ReplaceFst<Arc>(ifst_array, opts);
  /external/libvpx/build/make/
obj_int_extract.c 298 #define COPY_STRUCT(dst, buf, ofst, sz) do {\
299 if(ofst + sizeof((*(dst))) > sz) goto bail;\
300 memcpy(dst, buf+ofst, sizeof((*(dst))));\
460 int parse_elf_symbol(elf_obj_t *elf, unsigned int ofst, Elf32_Sym *sym32, Elf64_Sym *sym64)
464 COPY_STRUCT(sym32, elf->buf, ofst, elf->sz);
474 COPY_STRUCT(sym64, elf->buf, ofst, elf->sz);
490 unsigned int ofst; local
558 for (ofst = shdr.sh_offset;
559 ofst < shdr.sh_offset + shdr.sh_size;
560 ofst += shdr.sh_entsize
    [all...]
  /external/srec/tools/make_cfst/
make_cfst.cpp 229 fst::StdVectorFst* ofst = &myCfst; local
240 ofst = &fst2;
262 ofst->Write((const char*)cfstFilename);

Completed in 2113 milliseconds