HomeSort by relevance Sort by last modified time
    Searched full:arcs (Results 1 - 25 of 324) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /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...]
arcfilter.h 17 // Function objects to restrict which arcs are traversed in an FST.
24 // True for all arcs.
32 // True for (input/output) epsilon arcs.
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...]
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...]
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...]
const-fst.h 17 // Simple concrete immutable FST whose states and arcs are each stored
30 // States and arcs each implemented by single arrays, templated on the
72 A *Arcs(StateId s) { return arcs_ + states_[s].pos; }
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
109 A *arcs_; // Arcs representation
111 size_t narcs_; // Number of arcs (per FST
    [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...]
project.h 54 // Projects an FST onto its domain or range by either copying each arcs'
61 // where V = # of states and E = # of arcs.
75 // where v = # of states visited, e = # of arcs visited. Constant
invert.h 47 // where V = # of states and E = # of arcs.
58 // where v = # of states visited, e = # of arcs visited. Constant
  /external/webkit/Tools/CodeCoverage/
README 12 Tools/Scripts/build-webkit GCC_GENERATE_TEST_COVERAGE_FILES=YES GCC_INSTRUMENT_PROGRAM_FLOW_ARCS=YES EXTRA_LINK=" -ftest-coverage -fprofile-arcs" OTHER_CFLAGS=" -MD " OTHER_LDFLAGS=" -ftest-coverage -fprofile-arcs -framework AppKit"
14 Tools/Scripts/run-javascriptcore-tests GCC_GENERATE_TEST_COVERAGE_FILES=YES GCC_INSTRUMENT_PROGRAM_FLOW_ARCS=YES EXTRA_LINK=" -ftest-coverage -fprofile-arcs" OTHER_CFLAGS=" -MD " OTHER_LDFLAGS=" -ftest-coverage -fprofile-arcs -framework AppKit"
  /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...]
arcfilter.h 19 // Function objects to restrict which arcs are traversed in an FST.
31 // True for all arcs.
39 // True for (input/output) epsilon arcs.
49 // True for input epsilon arcs.
59 // True for output epsilon arcs.
cache.h 203 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[a]
295 const vector<Arc> &arcs = GetState(s)->arcs; local
501 vector<A> arcs; \/\/ Arcs represenation member in struct:fst::CacheState
    [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...]
const-fst.h 19 // Simple concrete immutable FST whose states and arcs are each stored
40 // States and arcs each implemented by single arrays, templated on the
92 A *Arcs(StateId s) { return arcs_ + states_[s].pos; }
103 data->arcs = arcs_ + states_[s].pos;
111 // States implemented by array *states_ below, arcs by (single) *arcs_.
114 Unsigned pos; // Start of state's arcs in *arcs_
115 Unsigned narcs; // Number of arcs (per state)
130 // Byte alignment for states and arcs in file format (version 1 only)
134 A *arcs_; // Arcs representation
136 size_t narcs_; // Number of arcs (per FST
    [all...]
arcsort.h 19 // Functions and classes to sort arcs in an FST.
83 // Sorts the arcs in an FST according to function object 'comp' of
104 // Sorts the arcs in an FST according to function object 'comp' of
162 // Compare class for comparing input labels of arcs.
176 // Compare class for comparing output labels of arcs.
replace.h 305 // 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 leaving the stat
    [all...]
project.h 68 // Projects an FST onto its domain or range by either copying each arcs'
75 // where V = # of states and E = # of arcs.
93 // where v = # of states visited, e = # of arcs visited. Constant
  /external/kernel-headers/original/asm-mips/
sgiarcs.h 18 /* Various ARCS error codes. */
41 /* SGI ARCS specific errno's. */
97 /* ARCS prom memory descriptors. */
100 arcs_rvpage, /* ARCS romvec page */
105 arcs_atmp, /* ARCS temporary storage area, wish Sparc OpenBoot told this */
106 arcs_aperm, /* ARCS permanent storage... */
109 /* ARC has slightly different types than ARCS */
122 enum arcs_memtypes arcs; member in union:linux_memtypes
143 /* ARCS virtual dirents. */
238 LONG TestUnicodeCharacter; /* ARC; not sure if ARCS too *
    [all...]
  /external/openfst/src/bin/
fstarcsort.cc 20 // Sorts arcs of an FST.
36 string usage = "Sorts arcs of an FST.\n\n Usage: ";
fstconnect.cc 20 // Removes useless (inaccessible or non-coaccessible) states and arcs
31 string usage = "Removes useless states and arcs from an FST.\n\n Usage: ";
fstprune.cc 20 // Prunes states and arcs of an FST w.r.t. the shortest path weight.
36 string usage = "Prunes states and arcs of an FST.\n\n Usage: ";
  /external/libxml2/include/libxml/
xlink.h 95 * @nbArcs: the number of arcs detected on the link
96 * @from: pointer to the array of source roles found on the arcs
97 * @to: pointer to the array of target roles found on the arcs
98 * @show: array of values for the show attributes found on the arcs
99 * @actuate: array of values for the actuate attributes found on the arcs
  /external/srec/srec/Semproc/include/
SR_SemanticGraphImpl.h 82 * Double linked list of arcs forming graph
100 * Free list of arcs for dynamic add word to slot.
105 * The number of arcs in the graph

Completed in 664 milliseconds

1 2 3 4 5 6 7 8 91011>>