| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| expanded-fst.h | 87 typename Arc::StateId nstates = 0; local
89 ++nstates;
90 return nstates;
|
| dfs-visit.h | 91 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;
|
| fst.h | 234 typename A::StateId nstates; // O.w. total # of states member in struct:fst::StateIteratorData
260 return data_.base ? data_.base->Done() : s_ >= data_.nstates;
|
| vector-fst.h | 79 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();
|
| /external/openfst/src/include/fst/ |
| dfs-visit.h | 106 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;
184 if (!expanded && root == nstates) {
[all...] |
| expanded-fst.h | 180 typename Arc::StateId nstates = 0; local
182 ++nstates;
183 return nstates;
|
| visit.h | 93 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, kWhiteState)
[all...] |
| replace-util.h | 110 // 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,
491 if (stats_[j].nstates <= nstates &
[all...] |
| vector-fst.h | 85 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();
|
| cache.h | 325 StateId nstates = 0; local
328 newid[s] = nstates;
329 ++nstates;
|
| fst.h | 327 typename A::StateId nstates; // O.w. total # of states member in struct:fst::StateIteratorData
354 return data_.base ? data_.base->Done() : s_ >= data_.nstates;
|
| /external/bison/src/ |
| state.c | 118 state_number nstates = 0; variable
136 aver (nstates < STATE_NUMBER_MAXIMUM);
139 res->number = nstates++;
163 aver (nstates < STATE_NUMBER_MAXIMUM);
166 res->number = nstates++;
428 bitset reachable = bitset_create (nstates, BITSET_FIXED);
432 for (i = 0; i < nstates; ++i)
443 old_to_new[i] = nstates;
447 nstates = nstates_reachable;
463 for (i = 0; i < nstates; ++i
[all...] |
| /bionic/libc/upstream-netbsd/libc/regex/ |
| regex2.h | 187 sopno nstates; /* = number of sops */ member in struct:re_guts
|
| /external/llvm/lib/Support/ |
| regex2.h | 135 sopno nstates; /* = number of sops */ member in struct:re_guts
|
| /ndk/sources/host-tools/ndk-stack/regex/ |
| regex2.h | 135 sopno nstates; /* = number of sops */ member in struct:re_guts
|
