| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| shortest-path.h | 51 // 'ifst'. 'distance' returns the shortest distances from the source
52 // state to each state in 'ifst'. 'opts' is used to specify options
61 void SingleShortestPath(const Fst<Arc> &ifst,
69 ofst->SetInputSymbols(ifst.InputSymbols());
70 ofst->SetOutputSymbols(ifst.OutputSymbols());
72 if (ifst.Start() == kNoStateId)
81 StateId source = opts.source == kNoStateId ? ifst.Start() : opts.source;
112 for (ArcIterator< Fst<Arc> > aiter(ifst, s);
137 if (ifst.Final(s) != Weight::Zero()) {
138 Weight w = Times(sd, ifst.Final(s))
[all...] |
| map.h | 158 void Map(const Fst<A> &ifst, MutableFst<B> *ofst, C* mapper) {
163 ofst->SetInputSymbols(ifst.InputSymbols());
164 ofst->SetOutputSymbols(ifst.OutputSymbols());
166 if (ifst.Start() == kNoStateId)
170 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next())
179 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) {
181 if (s == ifst.Start())
184 for (ArcIterator< Fst<A> > aiter(ifst, s); !aiter.Done(); aiter.Next())
190 B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId));
196 B final_arc = (*mapper)(A(0, 0, ifst.Final(s), kNoStateId))
[all...] |
| synchronize.h | 451 void Synchronize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) {
454 *ofst = SynchronizeFst<Arc>(ifst, opts);
|
| determinize.h | 710 void Determinize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
715 *ofst = DeterminizeFst<Arc>(ifst, nopts);
|
| /external/openfst/src/include/fst/script/ |
| prune.h | 97 const Fst<Arc>& ifst = *(args->arg1.GetFst<Arc>()); local
102 Prune(ifst, ofst, opts);
113 const Fst<Arc>& ifst = *(args->arg1.GetFst<Arc>()); local
117 Prune(ifst, ofst, w, args->arg4, args->arg5);
135 void Prune(const FstClass &ifst, MutableFstClass *fst,
139 void Prune(const FstClass &ifst, MutableFstClass *ofst,
|
| intersect.h | 56 void Intersect(const FstClass &ifst, const FstClass &ifst2,
|
| rmepsilon.h | 136 const Fst<Arc> &ifst = *(args->arg1.GetFst<Arc>()); local
143 Reverse(ifst, &rfst);
147 *ofst = ifst;
190 void RmEpsilon(const FstClass &ifst, MutableFstClass *ofst,
|
| shortest-distance.h | 237 void ShortestDistance(const FstClass &ifst, vector<WeightClass> *distance,
242 WeightClass ShortestDistance(const FstClass &ifst);
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| reverse.h | 38 void Reverse(const Fst<Arc> &ifst,
45 Reverse(ifst, ofst);
|
| replace.h | 91 const Fst<Arc> *ifst = ifst_array[fst_id].second; local
92 for (StateIterator< Fst<Arc> > siter(*ifst);
96 if (is == ifst->Start()) {
101 if (ifst->Final(is) != Weight::Zero()) {
103 ofst->SetFinal(os, ifst->Final(is));
104 fst_final[fst_id].push_back(make_pair(os, ifst->Final(is)));
106 for (ArcIterator< Fst<Arc> > aiter(*ifst, is);
|
| pdtscript.h | 115 void PdtExpand(const FstClass &ifst,
119 void PdtExpand(const FstClass &ifst,
180 void PdtReverse(const FstClass &ifst,
246 void PdtShortestPath(const FstClass &ifst,
270 void PrintPdtInfo(const FstClass &ifst,
|
| shortest-path.h | 392 PdtShortestPath(const Fst<Arc> &ifst,
396 ifst_(ifst.Copy()),
399 start_(ifst.Start()),
776 void ShortestPath(const Fst<Arc> &ifst,
781 PdtShortestPath<Arc, Queue> psp(ifst, parens, opts);
786 void ShortestPath(const Fst<Arc> &ifst,
792 PdtShortestPath<Arc, Queue> psp(ifst, parens, opts);
|
| expand.h | 346 // Constructor taking as input a PDT specified by 'ifst' and 'parens'.
350 PrunedExpand(const Fst<A> &ifst,
354 : ifst_(ifst.Copy()),
357 efst_(ifst, parens,
[all...] |
| /external/openfst/src/include/fst/ |
| prune.h | 210 // 'ifst' whose weight is no more than the weight of the shortest path
217 void Prune(const Fst<Arc> &ifst,
232 ofst->SetInputSymbols(ifst.InputSymbols());
233 ofst->SetOutputSymbols(ifst.OutputSymbols());
234 if (ifst.Start() == kNoStateId)
243 ShortestDistance(ifst, &tmp, true, opts.delta);
246 if ((fdistance->size() <= ifst.Start()) ||
247 ((*fdistance)[ifst.Start()] == Weight::Zero())) {
256 StateId s = ifst.Start();
277 if (!less(limit, Times(idistance[s], ifst.Final(s)))
[all...] |
| map.h | 42 void Map(const Fst<A> &ifst, MutableFst<B> *ofst, C* mapper) {
43 ArcMap(ifst, ofst, mapper);
47 void Map(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper) {
48 ArcMap(ifst, ofst, mapper);
|
| push.h | 118 // OFST obtained from IFST by pushing weights and/or labels according
124 void Push(const Fst<Arc> &ifst,
130 *ofst = ifst;
138 ArcMap(ifst, &gfst, ToGallicMapper<Arc, stype>());
143 uwfst(ifst, RmWeightMapper<Arc>());
165 ofst->SetOutputSymbols(ifst.OutputSymbols());
169 *ofst = ifst;
|
| mutable-fst.h | 134 Fst<A> *ifst = Fst<A>::Read(filename); local
135 if (!ifst) return 0;
136 if (ifst->Properties(kMutable, false)) {
137 return static_cast<MutableFst *>(ifst);
139 Fst<A> *ofst = Convert(*ifst, convert_type);
140 delete ifst;
|
| state-map.h | 130 void StateMap(const Fst<A> &ifst, MutableFst<B> *ofst, C* mapper) {
137 ofst->SetInputSymbols(ifst.InputSymbols());
142 ofst->SetOutputSymbols(ifst.OutputSymbols());
146 uint64 iprops = ifst.Properties(kCopyProperties, false);
148 if (ifst.Start() == kNoStateId) {
154 if (ifst.Properties(kExpanded, false))
155 ofst->ReserveStates(CountStates(ifst));
156 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next())
161 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) {
177 void StateMap(const Fst<A> &ifst, MutableFst<B> *ofst, C mapper)
[all...] |
| visit.h | 202 void InitVisit(const Fst<A> &ifst) {
203 ifst_ = &ifst;
255 void InitVisit(const Fst<A> &ifst) {
257 start_ = ifst.Start();
|
| arc-map.h | 200 void ArcMap(const Fst<A> &ifst, MutableFst<B> *ofst, C* mapper) {
207 ofst->SetInputSymbols(ifst.InputSymbols());
212 ofst->SetOutputSymbols(ifst.OutputSymbols());
216 uint64 iprops = ifst.Properties(kCopyProperties, false);
218 if (ifst.Start() == kNoStateId) {
224 if (ifst.Properties(kExpanded, false)) {
225 ofst->ReserveStates(CountStates(ifst) +
230 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next())
238 for (StateIterator< Fst<A> > siter(ifst); !siter.Done(); siter.Next()) {
240 if (s == ifst.Start()
[all...] |
| randgen.h | 613 void InitVisit(const Fst<IArc> &ifst) {
614 ifst_ = &ifst;
617 ofst_->SetInputSymbols(ifst.InputSymbols());
618 ofst_->SetOutputSymbols(ifst.OutputSymbols());
619 if (ifst.Properties(kError, false))
681 void RandGen(const Fst<IArc> &ifst, MutableFst<OArc> *ofst,
688 Sampler* arc_sampler = new Sampler(ifst, opts.arc_selector, opts.max_length);
692 RandFst rfst(ifst, fopts);
704 void RandGen(const Fst<IArc> &ifst, MutableFst<OArc> *ofst) {
707 RandGen(ifst, ofst, opts)
[all...] |
| replace-util.h | 281 const Fst<Arc> *ifst = fst_array_[i]; local
282 if (!ifst)
284 for (StateIterator<Fst<Arc> > siter(*ifst); !siter.Done(); siter.Next()) {
288 if (ifst->Final(s) != Weight::Zero())
291 for (ArcIterator<Fst<Arc> > aiter(*ifst, s);
|
| determinize.h | [all...] |
| synchronize.h | 449 void Synchronize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) {
452 *ofst = SynchronizeFst<Arc>(ifst, opts);
|
| /frameworks/base/tools/aidl/ |
| generate_java_rpc.cpp | 789 IfStatement* ifst = new IfStatement; local
790 ifst->expression = new Comparison(new FieldVariable(THIS_VALUE, "callback"), "!=", NULL_VALUE);
791 dispatchMethod->statements->Add(ifst);
792 ifst->statements->Add(realCall);
944 IfStatement* ifst = new IfStatement; local
945 ifst->expression = new Comparison(_presenter, "!=", NULL_VALUE);
946 stopListeningMethod->statements->Add(ifst);
948 ifst->statements->Add(new MethodCall(_presenter, "stopListening"));
949 ifst->statements->Add(new Assignment(_presenter, NULL_VALUE));
[all...] |
