| /external/openfst/src/include/fst/ |
| D | expanded-fst.h | 40 virtual StateId NumStates() const = 0; // State count
133 virtual StateId NumStates() const { return GetImpl()->NumStates(); } in NumStates() function
178 return efst->NumStates(); in CountStates()
|
| D | vector-fst.h | 59 StateId NumStates() const { return states_.size(); } in NumStates() function
191 using VectorFstBaseImpl<VectorState<A> >::NumStates;
333 if (hdr.NumStates() != kNoStateId) { in Read()
334 impl->ReserveStates(hdr.NumStates()); in Read()
338 for (;hdr.NumStates() == kNoStateId || s < hdr.NumStates(); ++s) { in Read()
370 if (hdr.NumStates() != kNoStateId && s != hdr.NumStates()) { in Read()
513 : nstates_(fst.GetImpl()->NumStates()), s_(0) {} in StateIterator()
575 if (num_states != hdr.NumStates()) { in WriteFst()
|
| D | reverse.h | 62 while (ofst->NumStates() <= os) in Reverse()
79 while (ofst->NumStates() <= nos) in Reverse()
|
| D | cache.h | 114 using VectorFstBaseImpl<State>::NumStates;
162 ReserveStates(impl.NumStates());
163 for (StateId s = 0; s < impl.NumStates(); ++s) {
203 else if (s < NumStates()) in CheckState()
321 size_t old_num_states = NumStates(); in DeleteStates()
350 for (int s = 0; s < NumStates(); ++s) { in DeleteStates()
521 while (NumStates() <= s) // Add state to main cache in ExtendState()
529 while (NumStates() <= cache_first_state_id_) in ExtendState()
|
| D | rmepsilon.h | 241 vector<bool> noneps_in(fst->NumStates(), false); in RmEpsilon()
243 for (StateId i = 0; i < fst->NumStates(); ++i) { in RmEpsilon()
255 states.reserve(fst->NumStates()); in RmEpsilon()
258 for (StateId i = 0; i < fst->NumStates(); i++) in RmEpsilon()
310 for (StateId s = 0; s < fst->NumStates(); ++s) { in RmEpsilon()
|
| D | edit-fst.h | 475 StateId NumStates() const { in NumStates() function
476 return wrapped_->NumStates() + data_->NumNewStates(); in NumStates()
486 hdr.SetNumStates(NumStates()); in Write()
528 return data_->AddState(NumStates()); in AddState()
572 data->nstates = NumStates(); in InitStateIterator()
|
| D | const-fst.h | 82 StateId NumStates() const { return nstates_; } in NumStates() function
213 impl->nstates_ = hdr.NumStates(); in Read()
415 if (hdr.NumStates() != num_states) { in WriteFst()
436 : nstates_(fst.GetImpl()->NumStates()), s_(0) {} in StateIterator()
|
| D | concat.h | 71 StateId numstates1 = fst1->NumStates(); in Concat()
136 StateId numstates2 = fst2->NumStates(); in Concat()
|
| D | compact-fst.h | 176 size_t NumStates() const { return nstates_; } in NumStates() function
368 data->nstates_ = hdr.NumStates(); in Read()
560 StateId NumStates() const { in NumStates() function
562 return data_->NumStates(); in NumStates()
652 hdr.SetNumStates(data_->NumStates()); in Write()
665 data->nstates = data_->NumStates(); in InitStateIterator()
941 num_states = impl->Data()->NumStates(); in WriteFst()
1037 : nstates_(fst.GetImpl()->NumStates()), s_(0) {} in StateIterator()
|
| D | add-on.h | 198 size_t NumStates() const { return fst_.NumStates(); } in NumStates() function
|
| D | statesort.h | 43 if (order.size() != fst->NumStates()) { in StateSort()
|
| D | label-reachable.h | 161 StateId ins = fst_->NumStates(); in fst_()
410 StateId ins = fst_->NumStates(); in TransformFst()
451 while (fst_->NumStates() < ons) { in TransformFst()
|
| D | closure.h | 62 fst->ReserveStates(fst->NumStates() + 1); in Closure()
|
| D | prune.h | 113 StateId ns = fst->NumStates(); in Prune()
290 (ofst->NumStates() >= opts.state_threshold)) in Prune()
|
| D | reweight.h | 49 if (fst->NumStates() == 0) in Reweight()
|
| D | union.h | 59 StateId numstates1 = fst1->NumStates(); in Union()
|
| D | replace-util.h | 259 if (depfst_.NumStates() > 0) { in GetDependencies()
434 for (StateId i = 0; i < pfst.NumStates(); ++i) { in ReplaceLabels()
|
| D | minimize.h | 221 P_.Initialize(Tr_.NumStates() - 1); in Initialize()
497 if (fst->NumStates() == 0) return; in AcceptorMinimize()
|
| /external/lldb/tools/debugserver/source/ |
| D | TTYState.h | 53 uint32_t NumStates() const { return sizeof(m_ttystates)/sizeof(TTYState); } in NumStates() function
54 bool ValidStateIndex(uint32_t idx) const { return idx < NumStates(); } in ValidStateIndex()
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| D | info.h | 53 int64 NumStates() const { return nstates_; } in NumStates() function
151 cout << "# of states" << pdtinfo.NumStates() << endl; in PrintPdtInfo()
|
| /external/openfst/src/include/fst/script/ |
| D | compile-impl.h | 81 while (s >= fst_.NumStates())
121 while (d >= fst_.NumStates())
|
| D | info-impl.h | 186 int64 NumStates() const { CheckLong(); return nstates_; } in NumStates() function
251 os << "# of states" << fstinfo.NumStates() << endl;
|
| /external/openfst/src/test/ |
| D | algo_test.h | 647 n = M.NumStates(); in TestOptimize()
650 CHECK(M.NumStates() <= n); in TestOptimize()
651 n = M.NumStates(); in TestOptimize()
670 CHECK_EQ(n + 1, M.NumStates()); // Accounts for the epsilon transition in TestOptimize()
680 while (potential.size() < RI.NumStates()) in TestOptimize()
1051 n = M.NumStates(); in TestOptimize()
1065 CHECK_EQ(n + 1, M.NumStates()); // Accounts for the epsilon transition in TestOptimize()
1100 bool equiv2 = ufsa.NumStates() == 0; in Equiv()
|
| D | fst_test.h | 118 CHECK_EQ(fst.NumStates(), ns); in TestExpanded()
151 CHECK_EQ(cfst1->NumStates(), 0); in TestMutable()
|
| /external/openfst/src/include/fst/extensions/ngram/ |
| D | ngram-fst.h | 168 StateId NumStates() const { in NumStates() function
381 if (num_context_arcs != context_fst.NumStates() - 1) { in NGramFstImpl()
386 if (context_fst.NumStates() != num_states) { in NGramFstImpl()
967 : s_(0), num_states_(fst.NumStates()) { } in StateIterator()
|