Searched defs:FindState (Results 1 - 10 of 10) sorted by relevance

/external/openfst/src/include/fst/
H A Dstate-table.h49 // StateId FindState(const StateTuple &);
85 StateId FindState(const StateTuple &tuple) { return FindId(tuple); } function in class:fst::HashStateTable
108 StateId FindState(const StateTuple &tuple) { return FindId(tuple); } function in class:fst::CompactHashStateTable
133 StateId FindState(const StateTuple &tuple) { return FindId(tuple); } function in class:fst::VectorStateTable
163 StateId FindState(const StateTuple &tuple) { return FindId(tuple); } function in class:fst::VectorHashStateTable
183 StateId FindState(const StateTuple &tuple) { return FindId(tuple); } function in class:fst::ErasableStateTable
204 // StateId FindState(const StateTuple &);
H A Dfactor-weight.h224 StateId start = FindState(Element(fst_->Start(), Weight::One()));
282 StateId FindState(const Element &e) { function in class:fst::FactorWeightFstImpl
316 StateId d = FindState(Element(arc.nextstate, Weight::One()));
321 StateId d = FindState(Element(arc.nextstate,
339 StateId d = FindState(Element(kNoStateId,
H A Dsynchronize.h122 StateId start = FindState(Element(fst_->Start(), empty, empty));
224 StateId FindState(const Element &e) { function in class:fst::SynchronizeFstImpl
250 StateId d = FindState(Element(arc.nextstate, istring, ostring));
256 StateId d = FindState(Element(arc.nextstate, istring, ostring));
266 StateId d = FindState(Element(kNoStateId, istring, ostring));
H A Ddeterminize.h179 // // If it doesn't exist, then add it. FindState takes
182 // StateId FindState(Subset *subset);
214 // state if the subset is not found. FindState takes ownership of
217 StateId FindState(Subset *subset) { function in class:fst::DefaultDeterminizeStateTable
532 return FindState(subset);
550 StateId FindState(Subset *subset) { function in class:fst::DeterminizeFsaImpl
551 StateId s = state_table_->FindState(subset);
668 arc.nextstate = FindState(dest_subset);
H A Dreplace.h67 // StateId FindState(const StateTuple &tuple);
220 StateId FindState(const StateTuple &tuple) { function in class:fst::VectorHashReplaceStateTable
221 return state_table_->FindState(tuple);
250 using StateTable::FindState;
486 StateId start = state_table_->FindState(
705 arcp->nextstate = state_table_->FindState(
730 ? state_table_->FindState(
749 ? state_table_->FindState(
759 ? state_table_->FindState(
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dfactor-weight.h180 StateId start = FindState(Element(fst_->Start(), Weight::One()));
229 StateId FindState(const Element &e) { function in class:fst::FactorWeightFstImpl
263 StateId d = FindState(Element(arc.nextstate, Weight::One()));
268 StateId d = FindState(Element(arc.nextstate,
284 StateId d = FindState(Element(kNoStateId,
H A Dsynchronize.h100 StateId start = FindState(Element(fst_->Start(), empty, empty));
193 StateId FindState(const Element &e) { function in class:fst::SynchronizeFstImpl
219 StateId d = FindState(Element(arc.nextstate, istring, ostring));
225 StateId d = FindState(Element(arc.nextstate, istring, ostring));
235 StateId d = FindState(Element(kNoStateId, istring, ostring));
H A Dreplace.h229 StateId start = FindState(StateTuple(prefix, root_, fst_start));
282 StateId FindState(const StateTuple& tuple) { function in class:fst::ReplaceFstImpl
311 FindState(StateTuple(prefix_id, top.fst_id, top.nextstate));
321 FindState(StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate));
337 StateId nt_nextstate = FindState(
344 FindState(
H A Dcompose.h417 StateId FindState(const StateTuple& tuple) { function in class:fst::ComposeFstImpl
436 arc.nextstate = FindState(tuple);
442 arc.nextstate = FindState(tuple);
625 return FindState(tuple);
H A Ddeterminize.h246 return FindState(subset);
263 // if the subset is not found in the subset hash. FindState takes
273 StateId FindState(Subset *subset) { function in class:fst::DeterminizeFsaImpl
368 arc.nextstate = FindState(dest_subset);

Completed in 242 milliseconds