| /external/openfst/src/include/fst/ |
| rmfinalepsilon.h | 19 // 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...] |
| replace-util.h | 110 // 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]);
|
| rmepsilon.h | 83 // Compute arcs and final weight for state 's'
86 // Returns arcs of expanded state.
87 vector<Arc> &Arcs() { return arcs_; }
138 // in the arcs vector of the state being expanded. 'e' corresponds
146 vector<Arc> arcs_; // Arcs of state being expanded
302 vector<Arc> &arcs = rmeps_state.Arcs(); local
303 fst->ReserveArcs(state, arcs.size());
304 while (!arcs.empty()) {
305 fst->AddArc(state, arcs.back())
483 vector<A> &arcs = rmeps_state_.Arcs(); local
[all...] |
| vector-fst.h | 19 // 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[narcs] = arcs[i]
174 vector<A> arcs; \/\/ Arcs represenation member in struct:fst::VectorState
257 const vector<A> &arcs = GetState(s)->arcs; local
[all...] |
| cache.h | 230 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.capacity() * sizeof(Arc)
288 const vector<Arc> &arcs = state->arcs; local
625 vector<A> arcs; \/\/ Arcs represenation member in struct:fst::CacheState
[all...] |
| fst.h | 143 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/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.
63 vector<A> arcs; local
68 arcs.clear();
73 // sum up all epsilon arcs
77 arcs.push_back(arc);
80 arcs.push_back(arc);
84 // If some arcs (epsilon arcs) were deleted, delete all
85 // 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 | 66 // Compute arcs and final weight for state 's'
69 // Returns arcs of expanded state.
70 vector<Arc> &Arcs() { return arcs_; }
119 // in the arcs vector of the state being expanded. 'e' corresponds
127 vector<Arc> arcs_; // Arcs of state being expanded
250 vector<Arc> &arcs = rmeps_state.Arcs(); local
251 while (!arcs.empty()) {
252 fst->AddArc(state, arcs.back());
253 arcs.pop_back()
388 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 = this->GetState(s)->arcs; local
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/ |
| parser.py | 210 def arcs(self): member in class:CodeParser
211 """Get information about the arcs available in the code.
224 arcs = expensive(arcs) variable in class:CodeParser
234 for l1, l2 in self.arcs():
242 # Arcs to excluded lines shouldn't count.
527 """Find the executable arcs in the code.
583 arcs = set()
593 arcs.add((chunk.line, exit_line))
595 arcs.add((-1, line)
[all...] |
| tracer.c | 69 PyObject * arcs; member in struct:__anon16086
73 /* Are we tracing arcs, or just lines? */
83 If tracing arcs, the keys are line number pairs. If not tracing arcs,
96 /* The line number of the last line recorded, for tracing arcs.
141 self->arcs = NULL;
408 /* Tracing arcs: key is (last_line,this_line). */
540 self->tracing_arcs = self->arcs && PyObject_IsTrue(self->arcs);
595 { "arcs", T_OBJECT, offsetof(CTracer, arcs), 0
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/plat-mac/lib-scriptpackages/StdSuites/ |
| QuickDraw_Graphics_Suite.py | 62 arcs = arc variable
|
| /prebuilts/sdk/current/support/v7/gridlayout/libs/ |
| android-support-v7-gridlayout.jar | |
| /sdk/testapps/gridlayoutTest/v7-gridlayout/libs/ |
| android-support-v7-gridlayout.jar | |
| /frameworks/base/core/java/android/widget/ |
| GridLayout.java | 1238 public Arc[] arcs; field in class:GridLayout.Axis
[all...] |
| /frameworks/support/v7/gridlayout/src/android/support/v7/widget/ |
| GridLayout.java | 1115 public Arc[] arcs; field in class:GridLayout.Axis
[all...] |
| /development/ndk/platforms/android-9/arch-mips/include/asm/ |
| sgiarcs.h | 126 enum arcs_memtypes arcs; member in union:linux_memtypes
|
| /external/chromium_org/third_party/freetype/src/raster/ |
| ftraster.c | 534 TPoint arcs[3 * MaxBezier + 1]; /* The Bezier stack */ member in struct:black_TWorker_
[all...] |
| /external/freetype/src/raster/ |
| ftraster.c | 536 TPoint arcs[3 * MaxBezier + 1]; /* The Bezier stack */ member in struct:black_TWorker_
[all...] |
| /external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/raster/ |
| ftraster.c | 536 TPoint arcs[3 * MaxBezier + 1]; /* The Bezier stack */ member in struct:black_TWorker_
[all...] |
| /prebuilts/ndk/8/platforms/android-14/arch-mips/usr/include/asm/ |
| sgiarcs.h | 126 enum arcs_memtypes arcs; member in union:linux_memtypes
|
