OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:ArcIterator
(Results
1 - 25
of
100
) sorted by null
1
2
3
4
/external/srec/tools/thirdparty/OpenFst/fst/lib/
invert.h
87
class
ArcIterator
< InvertFst<A> >
88
: public
ArcIterator
< MapFst<A, A, InvertMapper<A> > > {
90
ArcIterator
(const InvertFst<A> &fst, typename A::StateId s)
91
:
ArcIterator
< MapFst<A, A, InvertMapper<A> > >(fst, s) {}
project.h
105
class
ArcIterator
< ProjectFst<A> >
106
: public
ArcIterator
< MapFst<A, A, ProjectMapper<A> > > {
108
ArcIterator
(const ProjectFst<A> &fst, typename A::StateId s)
109
:
ArcIterator
< MapFst<A, A, ProjectMapper<A> > >(fst, s) {}
closure.h
128
class
ArcIterator
< ClosureFst<A> > : public
ArcIterator
< RationalFst<A> > {
132
ArcIterator
(const ClosureFst<A> &fst, StateId s)
133
:
ArcIterator
< RationalFst<A> >(fst, s) {}
difference.h
100
class
ArcIterator
< DifferenceFst<A> >
101
: public
ArcIterator
< ComposeFst<A> > {
105
ArcIterator
(const DifferenceFst<A> &fst, StateId s)
106
:
ArcIterator
< ComposeFst<A> >(fst, s) {}
intersect.h
91
class
ArcIterator
< IntersectFst<A> >
92
: public
ArcIterator
< ComposeFst<A> > {
96
ArcIterator
(const IntersectFst<A> &fst, StateId s)
97
:
ArcIterator
< ComposeFst<A> >(fst, s) {}
complement.h
51
friend class
ArcIterator
< ComplementFst<A> >;
111
friend class
ArcIterator
< ComplementFst<A> >;
215
class
ArcIterator
< ComplementFst<A> > : public ArcIteratorBase<A> {
221
ArcIterator
(const ComplementFst<A> &fst, StateId s)
224
aiter_ = new
ArcIterator
< Fst<A> >(*fst.impl_->fst_, s - 1);
226
virtual ~
ArcIterator
() { delete aiter_; }
269
ArcIterator
< Fst<A> > *aiter_;
273
DISALLOW_EVIL_CONSTRUCTORS(
ArcIterator
);
284
data->base = new
ArcIterator
< ComplementFst<A> >(*this, s);
concat.h
59
for (
ArcIterator
< Fst<Arc> > aiter(fst2, s2);
139
class
ArcIterator
< ConcatFst<A> > : public
ArcIterator
< RationalFst<A> > {
143
ArcIterator
(const ConcatFst<A> &fst, StateId s)
144
:
ArcIterator
< RationalFst<A> >(fst, s) {}
union.h
57
for (
ArcIterator
< Fst<Arc> > aiter(fst2, s2);
141
class
ArcIterator
< UnionFst<A> > : public
ArcIterator
< RationalFst<A> > {
145
ArcIterator
(const UnionFst<A> &fst, StateId s)
146
:
ArcIterator
< RationalFst<A> >(fst, s) {}
dfs-visit.h
70
ArcIterator
< Fst<Arc> > arc_iter; // and its corresponding arcs
107
ArcIterator
< Fst<Arc> > &aiter = dfs_state->arc_iter;
115
ArcIterator
< Fst<Arc> > &piter = parent_state->arc_iter;
rmfinalepsilon.h
50
for (
ArcIterator
<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
70
for (
ArcIterator
<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
statesort.h
59
for (
ArcIterator
< MutableFst<Arc> > aiter(*fst, s1);
68
for (
ArcIterator
< MutableFst<Arc> > aiter(*fst, s2);
randgen.h
72
for (
ArcIterator
< Fst<A> > aiter(fst, s); !aiter.Done();
82
for (
ArcIterator
< Fst<A> > aiter(fst, s); !aiter.Done();
143
ArcIterator
< Fst<Arc> > aiter(ifst, opts.source);
arcsort.h
54
for (
ArcIterator
< MutableFst<Arc> > aiter(*fst, s);
151
for (
ArcIterator
< Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next())
188
friend class
ArcIterator
< ArcSortFst<A, C> >;
262
class
ArcIterator
< ArcSortFst<A, C> >
267
ArcIterator
(const ArcSortFst<A, C> &fst, StateId s)
274
DISALLOW_EVIL_CONSTRUCTORS(
ArcIterator
);
/external/openfst/src/include/fst/
closure.h
141
class
ArcIterator
< ClosureFst<A> > : public
ArcIterator
< RationalFst<A> > {
145
ArcIterator
(const ClosureFst<A> &fst, StateId s)
146
:
ArcIterator
< RationalFst<A> >(fst, s) {}
invert.h
112
class
ArcIterator
< InvertFst<A> >
113
: public
ArcIterator
< ArcMapFst<A, A, InvertMapper<A> > > {
115
ArcIterator
(const InvertFst<A> &fst, typename A::StateId s)
116
:
ArcIterator
< ArcMapFst<A, A, InvertMapper<A> > >(fst, s) {}
project.h
135
class
ArcIterator
< ProjectFst<A> >
136
: public
ArcIterator
< ArcMapFst<A, A, ProjectMapper<A> > > {
138
ArcIterator
(const ProjectFst<A> &fst, typename A::StateId s)
139
:
ArcIterator
< ArcMapFst<A, A, ProjectMapper<A> > >(fst, s) {}
complement.h
56
friend class
ArcIterator
< ComplementFst<A> >;
143
friend class
ArcIterator
< ComplementFst<A> >;
234
class
ArcIterator
< ComplementFst<A> > : public ArcIteratorBase<A> {
240
ArcIterator
(const ComplementFst<A> &fst, StateId s)
243
aiter_ = new
ArcIterator
< Fst<A> >(*fst.GetImpl()->fst_, s - 1);
246
virtual ~
ArcIterator
() { delete aiter_; }
314
ArcIterator
< Fst<A> > *aiter_;
318
DISALLOW_COPY_AND_ASSIGN(
ArcIterator
);
329
data->base = new
ArcIterator
< ComplementFst<A> >(*this, s);
union.h
82
for (
ArcIterator
< Fst<Arc> > aiter(fst2, s2);
171
class
ArcIterator
< UnionFst<A> > : public
ArcIterator
< RationalFst<A> > {
175
ArcIterator
(const UnionFst<A> &fst, StateId s)
176
:
ArcIterator
< RationalFst<A> >(fst, s) {}
intersect.h
116
class
ArcIterator
< IntersectFst<A> >
117
: public
ArcIterator
< ComposeFst<A> > {
121
ArcIterator
(const IntersectFst<A> &fst, StateId s)
122
:
ArcIterator
< ComposeFst<A> >(fst, s) {}
map.h
95
class
ArcIterator
< MapFst<A, B, C> >
96
: public
ArcIterator
< ArcMapFst<A, B, C> > {
98
ArcIterator
(const ArcMapFst<A, B, C> &fst, typename A::StateId s)
99
:
ArcIterator
< ArcMapFst<A, B, C> >(fst, s) {}
concat.h
82
for (
ArcIterator
< Fst<Arc> > aiter(fst2, s2);
149
for (
ArcIterator
< Fst<Arc> > aiter(fst1, s1);
232
class
ArcIterator
< ConcatFst<A> > : public
ArcIterator
< RationalFst<A> > {
236
ArcIterator
(const ConcatFst<A> &fst, StateId s)
237
:
ArcIterator
< RationalFst<A> >(fst, s) {}
arcsort.h
60
for (
ArcIterator
< Fst<Arc> > aiter(fst_, s); !aiter.Done(); aiter.Next())
168
class
ArcIterator
< ArcSortFst<A, C> >
169
: public
ArcIterator
< StateMapFst<A, A, ArcSortMapper<A, C> > > {
171
ArcIterator
(const ArcSortFst<A, C> &fst, typename A::StateId s)
172
:
ArcIterator
< StateMapFst<A, A, ArcSortMapper<A, C> > >(fst, s) {}
dfs-visit.h
80
ArcIterator
< Fst<Arc> > arc_iter; // and its corresponding arcs
131
ArcIterator
< Fst<Arc> > &aiter = dfs_state->arc_iter;
139
ArcIterator
< Fst<Arc> > &piter = parent_state->arc_iter;
equal.h
65
ArcIterator
< Fst<Arc> > aiter1(fst1, s1);
66
ArcIterator
< Fst<Arc> > aiter2(fst2, s2);
rmfinalepsilon.h
56
for (
ArcIterator
<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
76
for (
ArcIterator
<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) {
Completed in 2778 milliseconds
1
2
3
4