Searched refs:arcs (Results 1 - 25 of 37) sorted by relevance

12

/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.
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...]
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 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 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 Drmepsilon.h66 // Compute arcs and final weight for state 's'
69 // Returns arcs of expanded state.
119 // in the arcs vector of the state being expanded. 'e' corresponds
250 vector<Arc> &arcs = rmeps_state.Arcs(); local
251 while (!arcs.empty()) {
252 fst->AddArc(state, arcs.back());
253 arcs.pop_back();
279 // where V = # of states visited, E = # of arcs.
388 vector<A> &arcs = rmeps_state_.Arcs(); local
389 while (!arcs
[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_];
H A Dconst-fst.h17 // Simple concrete immutable FST whose states and arcs are each stored
30 // States and arcs each implemented by single arrays, templated on the
83 data->arcs = arcs_ + states_[s].pos;
89 // States implemented by array *states_ below, arcs by (single) *arcs_.
92 uint32 pos; // Start of state's arcs in *arcs_
93 uint32 narcs; // Number of arcs (per state)
105 // Byte alignment for states and arcs in file format
111 size_t narcs_; // Number of arcs (per FST)
126 // count # of states and arcs
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/thirdparty/coverage/
H A Ddata.py20 * arcs: a dict mapping filenames to sorted lists of line number pairs:
61 self.arcs = {}
74 self.lines, self.arcs = self._read_file(self.filename)
76 self.lines, self.arcs = {}, {}
99 self.arcs = {}
110 [(f, self.sorted(amap.keys())) for f, amap in self.arcs.items()]
120 arcs = self.arc_data()
121 if arcs:
122 data['arcs'] = arcs
[all...]
H A Dcollector.py42 self.arcs = False
53 if self.arcs and self.cur_file_data:
82 if self.arcs:
90 if self.arcs and self.cur_file_data:
158 collecting data on which statements followed each other (arcs). Use
203 tracer.arcs = self.branch
300 for f, arcs in self.data.items():
302 for l1, _ in list(arcs.keys()):
H A Dxmlreport.py23 self.arcs = coverage.data.has_arcs()
120 if self.arcs:
132 if self.arcs:
H A Dhtml.py59 self.arcs = self.coverage.data.has_arcs()
135 arcs = self.arcs
157 elif self.arcs and lineno in missing_branch_arcs:
217 arcs = self.arcs
H A Dparser.py210 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():
527 """Find the executable arcs in the code.
583 arcs = set()
593 arcs.add((chunk.line, exit_line))
595 arcs.add((-1, line))
597 return arcs
[all...]
H A Dresults.py69 """Were arcs measured in this result?"""
73 """Returns a sorted list of the arcs in the code."""
74 arcs = self.parser.arcs()
75 return arcs
78 """Returns a sorted list of the arcs actually executed in the code."""
85 """Returns a sorted list of the arcs in the code not executed."""
96 """Returns a sorted list of the executed arcs missing from the code."""
99 # Exclude arcs here which connect a line to itself. They can occur
120 """Return arcs tha
[all...]
H A Dtracer.c69 PyObject * arcs; member in struct:__anon11461
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_OBJEC
[all...]
/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 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 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 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 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 Dreplace.h305 // with dynamic replacable arcs.
518 } else { // Otherwise compute the number of arcs without expanding.
563 // If epsilon_on_replace is false, all input epsilon arcs
564 // are also input epsilons arcs in the underlying machine.
567 // Otherwise, one need to consider that all non-terminal arcs
624 // return the base arc iterator, if arcs have not been computed yet,
625 // extend/recurse for new arcs.
636 // Extend current state (walk arcs one level deep)
654 // Expand all arcs leaving the state
678 // Expand all arcs leavin
[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/elfutils/0.153/config/
H A Deu.am43 COMPILE.os = $(filter-out -fprofile-arcs -ftest-coverage $(no_mudflap.os),\
/external/chromium_org/third_party/lcov/example/
H A DMakefile11 CFLAGS := -Wall -I. -fprofile-arcs -ftest-coverage
/external/zlib/src/contrib/puff/
H A DMakefile13 cc -fprofile-arcs -ftest-coverage -o puft puff.c pufftest.o

Completed in 1946 milliseconds

12