Searched defs:arcs (Results 1 - 8 of 8) 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.
138 // in the arcs vector of the state being expanded. 'e' corresponds
302 vector<Arc> &arcs = rmeps_state.Arcs(); local
303 fst->ReserveArcs(state, arcs.size());
304 while (!arcs.empty()) {
305 fst->AddArc(state, arcs.back());
306 arcs.pop_back();
342 // where V = # of states visited, E = # of arcs.
483 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.h230 state->arcs.push_back(arc);
237 const Arc *parc = state->arcs.empty() ? 0 : &(state->arcs.back());
253 state->arcs.push_back(arc);
256 // Marks arcs of state s as cached and does cache book-keeping after all
260 vector<Arc> &arcs = state->arcs; local
262 for (size_t a = 0; a < arcs.size(); ++a) {
263 const Arc &arc = arcs[a];
275 cache_size_ += arcs
288 const vector<Arc> &arcs = state->arcs; local
625 vector<A> arcs; // Arcs represenation member in struct:fst::CacheState
[all...]
H A Dfst.h143 int64 numarcs_; // # of arcs
160 // iterate over its states and arcs).
386 static const uint32 kArcNoCache = 0x0010; // No need to cache arcs
435 const A *arcs; // O.w. arcs pointer member in struct:fst::ArcIteratorData
478 return data_.base ? data_.base->Value() : data_.arcs[i_];
/external/freetype/src/raster/
H A Dftraster.c530 TPoint arcs[3 * MaxBezier + 1]; /* The Bezier stack */ member in struct:black_TWorker_
895 /* Subdivide one conic Bezier into two joint sub-arcs in the Bezier */
934 /* Subdivide a third-order Bezier arc into two joint sub-arcs in the */
1156 /* A function type describing the functions used to split Bezier arcs */
1172 /* splitter :: The function to split Bezier arcs. */
1305 /* splitter :: The function to split Bezier arcs. */
1469 ras.arc = ras.arcs;
1540 } while ( ras.arc >= ras.arcs );
1591 ras.arc = ras.arcs;
1675 } while ( ras.arc >= ras.arcs );
[all...]
/external/pdfium/third_party/freetype/src/raster/
H A Dftraster.c536 TPoint arcs[3 * MaxBezier + 1]; /* The Bezier stack */ member in struct:black_TWorker_
989 /* Subdivide one conic Bezier into two joint sub-arcs in the Bezier */
1028 /* Subdivide a third-order Bezier arc into two joint sub-arcs in the */
1250 /* A function type describing the functions used to split Bezier arcs */
1266 /* splitter :: The function to split Bezier arcs. */
1399 /* splitter :: The function to split Bezier arcs. */
1563 ras.arc = ras.arcs;
1634 } while ( ras.arc >= ras.arcs );
1685 ras.arc = ras.arcs;
1769 } while ( ras.arc >= ras.arcs );
[all...]

Completed in 156 milliseconds