HomeSort by relevance Sort by last modified time
    Searched full:numstates (Results 26 - 50 of 95) sorted by null

12 3 4

  /external/openfst/src/include/fst/
add-on.h 198 size_t NumStates() const { return fst_.NumStates(); }
concat.h 71 StateId numstates1 = fst1->NumStates();
136 StateId numstates2 = fst2->NumStates();
visit.h 96 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
209 while (ofst_->NumStates() <= s)
edit-fst.h 475 StateId NumStates() const {
476 return wrapped_->NumStates() + data_->NumNewStates();
486 hdr.SetNumStates(NumStates());
528 return data_->AddState(NumStates());
572 data->nstates = NumStates();
rmepsilon.h 241 vector<bool> noneps_in(fst->NumStates(), false);
243 for (StateId i = 0; i < fst->NumStates(); ++i) {
255 states.reserve(fst->NumStates());
258 for (StateId i = 0; i < fst->NumStates(); i++)
310 for (StateId s = 0; s < fst->NumStates(); ++s) {
compact-fst.h 176 size_t NumStates() const { return nstates_; }
368 data->nstates_ = hdr.NumStates();
560 StateId NumStates() const {
562 return data_->NumStates();
652 hdr.SetNumStates(data_->NumStates());
665 data->nstates = data_->NumStates();
941 num_states = impl->Data()->NumStates();
    [all...]
closure.h 62 fst->ReserveStates(fst->NumStates() + 1);
dfs-visit.h 109 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
reweight.h 49 if (fst->NumStates() == 0)
union.h 59 StateId numstates1 = fst1->NumStates();
minimize.h 221 P_.Initialize(Tr_.NumStates() - 1);
497 if (fst->NumStates() == 0) return;
properties.h 133 // If NumStates() > 0, then state 0 is initial, state NumStates()-1 is
prune.h 113 StateId ns = fst->NumStates();
290 (ofst->NumStates() >= opts.state_threshold))
replace-util.h 259 if (depfst_.NumStates() > 0) {
434 for (StateId i = 0; i < pfst.NumStates(); ++i) {
  /external/openfst/src/test/
algo_test.h 647 n = M.NumStates();
650 CHECK(M.NumStates() <= n);
651 n = M.NumStates();
670 CHECK_EQ(n + 1, M.NumStates()); // Accounts for the epsilon transition
680 while (potential.size() < RI.NumStates())
1051 n = M.NumStates();
1065 CHECK_EQ(n + 1, M.NumStates()); // Accounts for the epsilon transition
1100 bool equiv2 = ufsa.NumStates() == 0;
    [all...]
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
arcsort.h 81 using VectorFstBaseImpl<typename CacheImpl<A>::State>::NumStates;
155 if (s < NumStates()) { // ensure state exists
fst.h 84 int64 NumStates() const { return numstates_; }
93 void SetNumStates(int64 numstates) { numstates_ = numstates; }
properties.h 124 // If NumStates() > 0, then state 0 is initial, state NumStates()-1 is
concat.h 51 StateId numstates1= fst1->NumStates();
union.h 46 StateId numstates1 = fst1->NumStates();
minimize.h 208 P_.Initialize(Tr_.NumStates() - 1);
481 if (fst->NumStates() == 0) return;
  /external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
SimpleCLexer.java 704 int numStates = DFA4_transitionS.length;
705 DFA4_transition = new short[numStates][];
706 for (int i=0; i<numStates; i++) {
  /external/srec/tools/grxmlcompile/
fst-io.h 234 while (s >= fst_.NumStates())
274 while (d >= fst_.NumStates())
  /external/openfst/src/include/fst/extensions/ngram/
ngram-fst.h 168 StateId NumStates() const {
381 if (num_context_arcs != context_fst.NumStates() - 1) {
386 if (context_fst.NumStates() != num_states) {
967 : s_(0), num_states_(fst.NumStates()) { }
  /external/openfst/src/include/fst/extensions/pdt/
replace.h 86 for (StateId soff = 0; !non_term_queue.empty(); soff = ofst->NumStates()) {

Completed in 270 milliseconds

12 3 4