| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| arcsum.h | 17 // Functions to sum arcs (sum weights) in an fst.
53 // Combines identically labeled arcs, summing weights. For each state
54 // we combine arcs with the same input and output label, summing their
60 vector<A> arcs; local
65 // Sums arcs into arcs array.
66 arcs.clear();
67 arcs.reserve(fst->NumArcs(s));
70 arcs.push_back(aiter.Value());
72 // At each state, first sorts the exiting arcs by input label, output labe
[all...] |
| rmfinalepsilon.h | 17 // Function to remove of final states that have epsilon only input arcs.
64 vector<A> arcs; local
69 arcs.clear();
74 // sum up all epsilon arcs
78 arcs.push_back(arc);
81 arcs.push_back(arc);
85 // If some arcs (epsilon arcs) were deleted, delete all
86 // arcs and add back only the non epsilon arcs
[all...] |
| arcsort.h | 17 // Functions and classes to sort arcs in an FST.
29 // Sorts the arcs in an FST according to function object 'comp' of
48 vector<Arc> arcs; local
53 arcs.clear();
57 arcs.push_back(aiter.Value());
58 sort(arcs.begin(), arcs.end(), comp);
60 for (size_t a = 0; a < arcs.size(); ++a)
61 fst->AddArc(s, arcs[a]);
156 vector<A> &carcs = GetState(s)->arcs;
[all...] |
| cache.h | 140 cache_first_state_->arcs.capacity() * sizeof(Arc);
172 state->arcs.push_back(arc);
175 // Marks arcs of state s as cached.
178 vector<Arc> &arcs = state->arcs; local
180 for (unsigned int a = 0; a < arcs.size(); ++a) {
181 const Arc &arc = arcs[a];
192 cache_size_ += arcs.capacity() * sizeof(Arc);
200 state->arcs.reserve(n);
217 // Are arcs of state s cached
362 vector<A> arcs; \/\/ Arcs represenation member in struct:fst::CacheState
[all...] |
| rmepsilon.h | 68 // Compute arcs and final weight for state 's'
71 // Returns arcs of expanded state.
72 vector<Arc> &Arcs() { return arcs_; }
121 // in the arcs vector of the state being expanded. 'e' corresponds
129 vector<Arc> arcs_; // Arcs of state being expanded
252 vector<Arc> &arcs = rmeps_state.Arcs(); local
253 while (!arcs.empty()) {
254 fst->AddArc(state, arcs.back());
255 arcs.pop_back()
390 vector<A> &arcs = rmeps_state_.Arcs(); local
[all...] |
| fst.h | 107 int64 numarcs_; // # of arcs
116 // iterate over its states and arcs).
306 const A *arcs; // O.w. arcs pointer member in struct:fst::ArcIteratorData
343 return data_.base ? data_.base->Value() : data_.arcs[i_];
|
| vector-fst.h | 17 // Simple concrete, mutable FST whose states and arcs are stored in STL
33 // States and arcs implemented by STL vectors, templated on the
55 size_t NumArcs(StateId s) const { return states_[s]->arcs.size(); }
72 states_[s]->arcs.push_back(arc);
92 vector<Arc> &arcs = states_[s]->arcs; local
94 for (size_t i = 0; i < arcs.size(); ++i) {
95 StateId t = newid[arcs[i].nextstate];
97 arcs[i].nextstate = t;
99 arcs[narcs] = arcs[i]
168 vector<A> arcs; \/\/ Arcs represenation member in struct:fst::VectorState
291 const vector<A> &arcs = GetState(s)->arcs; local
[all...] |
| /external/freetype/src/raster/ |
| ftraster.c | 518 TPoint arcs[3 * MaxBezier + 1]; /* The Bezier stack */ member in struct:TWorker_
[all...] |
