Searched defs:arcs (Results 1 - 15 of 15) sorted by relevance

/external/openfst/src/include/fst/
H A Drmfinalepsilon.h19 // Function to remove of final states that have epsilon only input arcs.
70 vector<A> arcs; local
75 arcs.clear();
80 // sum up all epsilon arcs
84 arcs.push_back(arc);
87 arcs.push_back(arc);
91 // If some arcs (epsilon arcs) were deleted, delete all
92 // arcs and add back only the non epsilon arcs
[all...]
H A Dreplace-util.h110 // Replaces Fsts that have at most 'nstates' states, 'narcs' arcs and
139 size_t narcs; // # of arcs
435 vector<Arc> arcs; local
441 arcs.push_back(arc);
444 for (size_t j = 0; j < arcs.size(); ++j)
445 pfst.AddArc(i, arcs[j]);
H A Drmepsilon.h83 // Compute arcs and final weight for state 's'
86 // Returns arcs of expanded state.
139 // in the arcs vector of the state being expanded. 'e' corresponds
303 vector<Arc> &arcs = rmeps_state.Arcs(); local
304 fst->ReserveArcs(state, arcs.size());
305 while (!arcs.empty()) {
306 fst->AddArc(state, arcs.back());
307 arcs.pop_back();
343 // where V = # of states visited, E = # of arcs.
484 vector<A> &arcs local
[all...]
H A Dvector-fst.h19 // Simple concrete, mutable FST whose states and arcs are stored in STL
39 // States and arcs implemented by STL vectors, templated on the
61 size_t NumArcs(StateId s) const { return states_[s]->arcs.size(); }
78 states_[s]->arcs.push_back(arc);
98 vector<Arc> &arcs = states_[s]->arcs; local
100 for (size_t i = 0; i < arcs.size(); ++i) {
101 StateId t = newid[arcs[i].nextstate];
103 arcs[i].nextstate = t;
105 arcs[narc
174 vector<A> arcs; // Arcs represenation member in struct:fst::VectorState
257 const vector<A> &arcs = GetState(s)->arcs; local
[all...]
H A Dcache.h203 cache_first_state_->arcs.capacity() * sizeof(Arc);
239 state->arcs.push_back(arc);
246 const Arc *parc = state->arcs.empty() ? 0 : &(state->arcs.back());
261 state->arcs.push_back(arc);
264 // Marks arcs of state s as cached and does cache book-keeping after all
268 vector<Arc> &arcs = state->arcs; local
270 for (size_t a = 0; a < arcs.size(); ++a) {
271 const Arc &arc = arcs[
295 const vector<Arc> &arcs = GetState(s)->arcs; local
501 vector<A> arcs; // Arcs represenation member in struct:fst::CacheState
[all...]
H A Dfst.h136 int64 numarcs_; // # of arcs
153 // iterate over its states and arcs).
380 static const uint32 kArcNoCache = 0x0010; // No need to cache arcs
429 const A *arcs; // O.w. arcs pointer member in struct:fst::ArcIteratorData
472 return data_.base ? data_.base->Value() : data_.arcs[i_];
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Darcsum.h17 // 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 b
[all...]
H A Drmfinalepsilon.h17 // 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...]
H A Darcsort.h17 // 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...]
H A Dcache.h140 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 o
362 vector<A> arcs; // Arcs represenation member in struct:fst::CacheState
[all...]
H A Drmepsilon.h68 // Compute arcs and final weight for state 's'
71 // Returns arcs of expanded state.
121 // in the arcs vector of the state being expanded. 'e' corresponds
252 vector<Arc> &arcs = rmeps_state.Arcs(); local
253 while (!arcs.empty()) {
254 fst->AddArc(state, arcs.back());
255 arcs.pop_back();
281 // where V = # of states visited, E = # of arcs.
390 vector<A> &arcs = rmeps_state_.Arcs(); local
391 while (!arcs
[all...]
H A Dvector-fst.h17 // 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[narc
168 vector<A> arcs; // Arcs represenation member in struct:fst::VectorState
291 const vector<A> &arcs = this->GetState(s)->arcs; local
[all...]
H A Dfst.h107 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_];
/external/freetype/src/raster/
H A Dftraster.c525 TPoint arcs[3 * MaxBezier + 1]; /* The Bezier stack */ member in struct:black_TWorker_
972 /* Subdivide one conic Bezier into two joint sub-arcs in the Bezier */
1011 /* Subdivide a third-order Bezier arc into two joint sub-arcs in the */
1233 /* A function type describing the functions used to split Bezier arcs */
1249 /* splitter :: The function to split Bezier arcs. */
1382 /* splitter :: The function to split Bezier arcs. */
1546 ras.arc = ras.arcs;
1617 } while ( ras.arc >= ras.arcs );
1668 ras.arc = ras.arcs;
1752 } while ( ras.arc >= ras.arcs );
[all...]
/external/kernel-headers/original/asm-mips/
H A Dsgiarcs.h122 enum arcs_memtypes arcs; member in union:linux_memtypes

Completed in 337 milliseconds