Searched refs:ofst (Results 1 - 25 of 120) sorted by last modified time

12345

/external/sqlite/dist/orig/
H A Dsqlite3.c28334 unixShmSystemLock( unixShmNode *pShmNode, int lockType, int ofst, int n ) argument
28766 unixShmLock( sqlite3_file *fd, int ofst, int n, int flags ) argument
35380 winShmSystemLock( winShmNode *pFile, int lockType, int ofst, int nByte ) argument
35629 winShmLock( sqlite3_file *fd, int ofst, int n, int flags ) argument
42529 i64 ofst = (pgno-1)*(i64)pPager->pageSize; local
[all...]
/external/sqlite/dist/
H A Dsqlite3.c28354 unixShmSystemLock( unixShmNode *pShmNode, int lockType, int ofst, int n ) argument
28786 unixShmLock( sqlite3_file *fd, int ofst, int n, int flags ) argument
35400 winShmSystemLock( winShmNode *pFile, int lockType, int ofst, int nByte ) argument
35649 winShmLock( sqlite3_file *fd, int ofst, int n, int flags ) argument
42549 i64 ofst = (pgno-1)*(i64)pPager->pageSize; local
[all...]
/external/srec/tools/make_cfst/
H A Dmake_cfst.cpp229 fst::StdVectorFst* ofst = &myCfst; local
240 ofst = &fst2;
262 ofst->Write((const char*)cfstFilename);
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dcompose.h896 MutableFst<Arc> *ofst,
900 *ofst = ComposeFst<Arc>(ifst1, ifst2, nopts);
902 Connect(ofst);
895 Compose(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, MutableFst<Arc> *ofst, const ComposeOptions &opts = ComposeOptions()) argument
H A Ddeterminize.h710 void Determinize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument
715 *ofst = DeterminizeFst<Arc>(ifst, nopts);
H A Ddifference.h129 MutableFst<Arc> *ofst,
133 *ofst = DifferenceFst<Arc>(ifst1, ifst2, nopts);
135 Connect(ofst);
128 Difference(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, MutableFst<Arc> *ofst, const DifferenceOptions &opts = DifferenceOptions()) argument
H A Depsnormalize.h48 void EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument
61 Map(fwfst, ofst, FromGallicMapper<Arc, STRING_RIGHT_RESTRICT>());
63 Invert(ofst);
H A Dintersect.h119 MutableFst<Arc> *ofst,
123 *ofst = IntersectFst<Arc>(ifst1, ifst2, nopts);
125 Connect(ofst);
118 Intersect(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, MutableFst<Arc> *ofst, const IntersectOptions &opts = IntersectOptions()) argument
H A Dmap.h158 void Map(const Fst<A> &ifst, MutableFst<B> *ofst, C* mapper) { argument
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
231 Map(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) argument
[all...]
H A Dprune.h136 // '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,
141 Prune(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, const PruneOptions<Arc, ArcFilter> &opts) argument
238 Prune(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, typename Arc::Weight threshold) argument
[all...]
H A Dpush.h57 void Push(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, uint32 ptype) { argument
60 *ofst = ifst;
61 Push(ofst, rtype);
81 Map(fwfst, ofst, FromGallicMapper<Arc, stype>());
83 *ofst = ifst;
H A Drandgen.h106 int64 dest; // 'ofst' state to append
117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument
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
161 RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) argument
[all...]
H A Dreplace.h674 MutableFst<Arc> *ofst, typename Arc::Label root) {
677 *ofst = ReplaceFst<Arc>(ifst_array, opts);
672 Replace(const vector<pair<typename Arc::Label, const Fst<Arc>* > >& ifst_array, MutableFst<Arc> *ofst, typename Arc::Label root) argument
H A Dreverse.h36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) { argument
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
[all...]
H A Dshortest-path.h50 // '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' contain
61 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
228 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
351 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, size_t n = 1, bool unique = false) argument
[all...]
H A Dsynchronize.h451 void Synchronize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) { argument
454 *ofst = SynchronizeFst<Arc>(ifst, opts);
/external/openfst/src/bin/
H A Dfstcompose.cc70 VectorFstClass ofst(ifst1->ArcType());
90 s::Compose(*ifst1, *ifst2, &ofst, opts);
92 ofst.Write(out_name);
H A Dfstconvert.cc48 FstClass *ofst = ifst;
49 if (!ofst) return 1;
51 if (ofst->FstType() != FLAGS_fst_type) {
52 ofst = s::Convert(*ifst, FLAGS_fst_type);
55 ofst->Write(out_name);
H A Dfstdeterminize.cc56 VectorFstClass ofst(ifst->ArcType());
63 s::Determinize(*ifst, &ofst, opts);
65 ofst.Write(out_name);
H A Dfstdifference.cc62 VectorFstClass ofst(ifst1->ArcType());
82 s::Difference(*ifst1, *ifst2, &ofst, opts);
84 ofst.Write(out_name);
H A Dfstepsnormalize.cc53 VectorFstClass ofst(ifst->ArcType());
54 s::EpsNormalize(*ifst, &ofst, eps_norm_type);
55 ofst.Write(out_name);
H A Dfstintersect.cc63 VectorFstClass ofst(ifst1->ArcType());
83 s::Intersect(*ifst1, *ifst2, &ofst, opts);
85 ofst.Write(out_name);
H A Dfstmap.cc92 FstClass *ofst = s::Map(*ifst, mt, FLAGS_delta, w); local
94 ofst->Write(out_name);
H A Dfstpush.cc66 VectorFstClass ofst(ifst->ArcType());
69 s::Push(*ifst, &ofst, flags, fst::REWEIGHT_TO_FINAL, FLAGS_delta);
71 s::Push(*ifst, &ofst, flags, fst::REWEIGHT_TO_INITIAL, FLAGS_delta);
74 ofst.Write(out_name);
H A Dfstrandgen.cc59 VectorFstClass ofst(ifst->ArcType());
75 s::RandGen(*ifst, &ofst, FLAGS_seed,
80 ofst.Write(out_name);

Completed in 398 milliseconds

12345