Searched defs:nstates (Results 1 - 12 of 12) sorted by relevance

/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dexpanded-fst.h87 typename Arc::StateId nstates = 0; local
89 ++nstates;
90 return nstates;
H A Ddfs-visit.h91 StateId nstates = CountStates(fst); local
93 while ((StateId)state_color.size() < nstates)
100 for (StateId root = start; dfs && root < nstates;) {
150 root < nstates && state_color[root] != kDfsWhite;
H A Dvector-fst.h79 StateId nstates = 0; local
82 newid[s] = nstates;
83 if (s != nstates)
84 states_[nstates] = states_[s];
85 ++nstates;
90 states_.resize(nstates);
140 data->nstates = states_.size();
H A Dfst.h234 typename A::StateId nstates; // O.w. total # of states member in struct:fst::StateIteratorData
260 return data_.base ? data_.base->Done() : s_ >= data_.nstates;
/external/openfst/src/include/fst/
H A Ddfs-visit.h106 StateId nstates = start + 1; // # of known states in general case local
109 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
113 state_color.resize(nstates, kDfsWhite);
120 for (StateId root = start; dfs && root < nstates;) {
128 nstates = s + 1;
129 state_color.resize(nstates, kDfsWhite);
149 nstates = arc.nextstate + 1;
150 state_color.resize(nstates, kDfsWhite);
179 root < nstates && state_color[root] != kDfsWhite;
183 if (!expanded && root == nstates) {
[all...]
H A Dexpanded-fst.h180 typename Arc::StateId nstates = 0; local
182 ++nstates;
183 return nstates;
H A Dvisit.h93 StateId nstates = start + 1; // # of known states in general case local
96 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
100 state_status.resize(nstates, kWhiteState);
101 arc_iterator.resize(nstates);
108 for (StateId root = start; visit && root < nstates;) {
115 nstates = s + 1;
116 state_status.resize(nstates, kWhiteState);
117 arc_iterator.resize(nstates);
139 nstates = arc.nextstate + 1;
140 state_status.resize(nstates, kWhiteStat
[all...]
H A Dreplace-util.h110 // Replaces Fsts that have at most 'nstates' states, 'narcs' arcs and
113 void ReplaceBySize(size_t nstates, size_t narcs, size_t nnonterms);
137 StateId nstates; // # of states member in struct:fst::ReplaceUtil::ReplaceStats
149 : nstates(0),
287 ++stats_[i].nstates;
334 stats_[i].nstates += stats_[j].nstates * ni;
478 void ReplaceUtil<Arc>::ReplaceBySize(size_t nstates, size_t narcs, argument
491 if (stats_[j].nstates <= nstates
[all...]
H A Dvector-fst.h85 StateId nstates = 0; local
88 newid[s] = nstates;
89 if (s != nstates)
90 states_[nstates] = states_[s];
91 ++nstates;
96 states_.resize(nstates);
146 data->nstates = states_.size();
H A Dfst.h321 typename A::StateId nstates; // O.w. total # of states member in struct:fst::StateIteratorData
348 return data_.base ? data_.base->Done() : s_ >= data_.nstates;
/external/bison/src/
H A Dstate.c120 state_number nstates = 0; variable
138 assert (nstates < STATE_NUMBER_MAXIMUM);
141 res->number = nstates++;
367 for (i = 0; i < nstates; ++i)
/external/llvm/lib/Support/
H A Dregex2.h135 sopno nstates; /* = number of sops */ member in struct:re_guts

Completed in 5342 milliseconds