Searched refs:NumStates (Results 26 - 50 of 50) sorted by relevance

12

/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Darcsort.h81 using VectorFstBaseImpl<typename CacheImpl<A>::State>::NumStates;
155 if (s < NumStates()) { // ensure state exists
H A Dprune.h67 StateId ns = fst->NumStates();
H A Dminimize.h208 P_.Initialize(Tr_.NumStates() - 1);
481 if (fst->NumStates() == 0) return;
H A Dmap.h97 for (StateId s = 0; s < fst->NumStates(); ++s) {
257 using VectorFstBaseImpl<typename CacheImpl<B>::State>::NumStates;
490 StateId NumStates() const { return impl_->NumStates(); } function in class:fst::MapFst
H A Dfst.h84 int64 NumStates() const { return numstates_; } function in class:fst::FstHeader
H A Dshortest-path.h264 while (distance->size() < rfst.NumStates())
H A Drmepsilon.h212 for (StateId i = 0; i < (StateId)fst->NumStates(); i++)
/external/openfst/src/include/fst/
H A Dedit-fst.h475 StateId NumStates() const { function in class:fst::EditFstImpl
476 return wrapped_->NumStates() + data_->NumNewStates();
486 hdr.SetNumStates(NumStates());
528 return data_->AddState(NumStates());
572 data->nstates = NumStates();
H A Dlabel-reachable.h161 StateId ins = fst_->NumStates();
410 StateId ins = fst_->NumStates();
451 while (fst_->NumStates() < ons) {
H A Dcompact-fst.h176 size_t NumStates() const { return nstates_; } function in class:fst::CompactFstData
368 data->nstates_ = hdr.NumStates();
560 StateId NumStates() const { function in class:fst::CompactFstImpl
562 return data_->NumStates();
652 hdr.SetNumStates(data_->NumStates());
665 data->nstates = data_->NumStates();
941 num_states = impl->Data()->NumStates();
1037 : nstates_(fst.GetImpl()->NumStates()), s_(0) {}
H A Dprune.h113 StateId ns = fst->NumStates();
290 (ofst->NumStates() >= opts.state_threshold))
H A Dstring.h98 while (fst->NumStates() <= labels.size())
H A Dvisit.h96 nstates = CountStates(fst); // uses ExpandedFst::NumStates().
209 while (ofst_->NumStates() <= s)
H A Dminimize.h221 P_.Initialize(Tr_.NumStates() - 1);
497 if (fst->NumStates() == 0) return;
H A Dreplace-util.h259 if (depfst_.NumStates() > 0) {
434 for (StateId i = 0; i < pfst.NumStates(); ++i) {
H A Dshortest-path.h344 ofst->NumStates() >= state_threshold))
H A Dstate-map.h107 for (StateId s = 0; s < fst->NumStates(); ++s) {
H A Dfst.h119 int64 NumStates() const { return numstates_; } function in class:fst::FstHeader
H A Darc-map.h134 for (StateId s = 0; s < fst->NumStates(); ++s) {
/external/openfst/src/include/fst/script/
H A Dinfo-impl.h42 // should call directly the relevant library functions: Fst<A>::NumStates,
186 int64 NumStates() const { CheckLong(); return nstates_; } function in class:fst::FstInfo
251 os << "# of states" << fstinfo.NumStates() << endl;
/external/openfst/src/test/
H A Dalgo_test.h647 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;
/external/srec/tools/grxmlcompile/
H A Dfst-io.h234 while (s >= fst_.NumStates())
274 while (d >= fst_.NumStates())
/external/openfst/src/include/fst/extensions/pdt/
H A Dreplace.h86 for (StateId soff = 0; !non_term_queue.empty(); soff = ofst->NumStates()) {
H A Dexpand.h367 rfst_.NumStates(), 10, -1);
615 while (ofst_->NumStates() <= s) ofst_->AddState();
/external/openfst/src/include/fst/extensions/ngram/
H A Dngram-fst.h168 StateId NumStates() const { function in class:fst::NGramFstImpl
381 if (num_context_arcs != context_fst.NumStates() - 1) {
386 if (context_fst.NumStates() != num_states) {
967 : s_(0), num_states_(fst.NumStates()) { }

Completed in 385 milliseconds

12