HomeSort by relevance Sort by last modified time
    Searched refs:NumArcs (Results 1 - 21 of 21) sorted by null

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
arcsum.h 63 if (fst->NumArcs(s) == 0) continue;
67 arcs.reserve(fst->NumArcs(s));
randgen.h 33 // N s.t. 0 <= N <= NumArcs(). If N < NumArcs(), then the N-th
34 // transition is selected. If N == NumArcs(), then the final weight at
50 size_t n = fst.NumArcs(s);
135 if (ifst.NumArcs(opts.source) == 0 &&
140 if (n == ifst.NumArcs(opts.source)) { // Take 'super-final' transition
equal.h 106 CHECK_EQ(fst1.NumArcs(s1), fst2.NumArcs(s2));
complement.h 83 size_t NumArcs(StateId s) const {
87 return fst_->NumArcs(s - 1) + 1;
160 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
arcsort.h 122 size_t NumArcs(StateId s) {
125 return CacheImpl<A>::NumArcs(s);
211 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
rmfinalepsilon.h 87 if (arcs.size() < fst->NumArcs(s)) {
const-fst.h 62 size_t NumArcs(StateId s) const { return states_[s].narcs; }
169 impl->narcs_ = hdr.NumArcs();
247 size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
369 : arcs_(fst.impl_->Arcs(s)), narcs_(fst.impl_->NumArcs(s)), i_(0) {}
factor-weight.h 204 size_t NumArcs(StateId s) {
207 return CacheImpl<A>::NumArcs(s);
364 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
relabel.h 246 size_t NumArcs(StateId s) {
250 return CacheImpl<A>::NumArcs(s);
362 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
synchronize.h 118 size_t NumArcs(StateId s) {
121 return CacheImpl<A>::NumArcs(s);
347 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
minimize.h 75 if (fst_.NumArcs(x) < fst_.NumArcs(y)) return true;
76 if (fst_.NumArcs(x) > fst_.NumArcs(y)) return false;
225 if (Tr_.NumArcs(s + 1))
determinize.h 167 size_t NumArcs(StateId s) {
170 return CacheImpl<A>::NumArcs(s);
567 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
replace.h 255 size_t NumArcs(StateId s) {
258 return CacheImpl<A>::NumArcs(s);
569 virtual size_t NumArcs(StateId s) const {
570 return impl_->NumArcs(s);
rmepsilon.h 363 size_t NumArcs(StateId s) {
366 return CacheImpl<A>::NumArcs(s);
453 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
rational.h 203 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
compose.h 147 size_t NumArcs(StateId s) {
150 return CacheImpl<A>::NumArcs(s);
478 size_t numarcsa = fsta->NumArcs(sa);
540 size_t numarcsf = fsta->NumArcs(sf);
592 bool FindLabel(ArcIterator< Fst<A> > *aiter, size_t numarcs,
596 size_t high = numarcs;
711 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
    [all...]
fst.h 85 int64 NumArcs() const { return numarcs_; }
94 void SetNumArcs(int64 numarcs) { numarcs_ = numarcs; }
130 virtual size_t NumArcs(StateId) const = 0; // State's arc count
map.h 334 size_t NumArcs(StateId s) {
337 return CacheImpl<B>::NumArcs(s);
492 size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
test-properties.h 203 if (fst.NumArcs(s) != 1) {
vector-fst.h 55 size_t NumArcs(StateId s) const { return states_[s]->arcs.size(); }
335 ReserveArcs(s, fst.NumArcs(s));
495 virtual size_t NumArcs(StateId s) const { return impl_->NumArcs(s); }
cache.h 233 size_t NumArcs(StateId s) const {

Completed in 757 milliseconds