OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:MutableFst
(Results
1 - 25
of
32
) sorted by null
1
2
/external/srec/tools/thirdparty/OpenFst/fst/lib/
statesort.h
33
void StateSort(
MutableFst
<Arc> *fst,
51
for (StateIterator<
MutableFst
<Arc> > siter(*fst);
59
for (ArcIterator<
MutableFst
<Arc> > aiter(*fst, s1);
68
for (ArcIterator<
MutableFst
<Arc> > aiter(*fst, s2);
mutable-fst.h
33
class
MutableFst
: public ExpandedFst<A> {
39
virtual
MutableFst
<A> &operator=(const Fst<A> &fst) = 0;
68
// Get a copy of this
MutableFst
.
69
virtual
MutableFst
<A> *Copy() const = 0;
70
// Read an
MutableFst
from an input stream; return NULL on error.
71
static
MutableFst
<A> *Read(istream &strm, const FstReadOptions &opts) {
82
LOG(ERROR) << "
MutableFst
::Read: Not an
MutableFst
: " << ropts.source;
89
LOG(ERROR) << "
MutableFst
::Read: Unknown FST type \"" << hdr.FstType()
96
return down_cast<
MutableFst
<A> *>(fst)
[
all
...]
fst-decl.h
36
template <class A> class
MutableFst
;
60
typedef
MutableFst
<StdArc> StdMutableFst;
epsnormalize.h
50
void EpsNormalize(const Fst<Arc> &ifst,
MutableFst
<Arc> *ofst,
reweight.h
39
void Reweight(
MutableFst
<Arc> *fst, vector<typename Arc::Weight> potential,
58
for (StateIterator<
MutableFst
<Arc> > sit(*fst);
62
for (MutableArcIterator<
MutableFst
<Arc> > ait(fst, state);
91
for (MutableArcIterator<
MutableFst
<Arc> > ait(fst, state);
push.h
41
void Push(
MutableFst
<Arc> *fst, ReweightType type) {
57
void Push(const Fst<Arc> &ifst,
MutableFst
<Arc> *ofst, uint32 ptype) {
prune.h
56
void Prune(
MutableFst
<Arc> *fst,
97
for (MutableArcIterator<
MutableFst
<Arc> > it(fst, state);
128
void Prune(
MutableFst
<Arc> *fst, typename Arc::Weight threshold) {
135
// output
MutableFst
and it takes an options class as an argument.
142
MutableFst
<Arc> *ofst,
232
// output
MutableFst
and simply takes the pruning threshold as an
239
MutableFst
<Arc> *ofst,
closure.h
28
//
MutableFst
input. If FST transduces string x to y with weight a,
39
void Closure(
MutableFst
<Arc> *fst, ClosureType closure_type) {
46
for (StateIterator<
MutableFst
<Arc> > siter(*fst);
invert.h
49
void Invert(
MutableFst
<Arc> *fst) { Map(fst, InvertMapper<Arc>()); }
randgen.h
117
void RandGen(const Fst<Arc> &ifst,
MutableFst
<Arc> *ofst,
161
void RandGen(const Fst<Arc> &ifst,
MutableFst
<Arc> *ofst) {
arcsum.h
57
void ArcSum(
MutableFst
<A>* fst) {
project.h
63
void Project(
MutableFst
<Arc> *fst, ProjectType project_type) {
reverse.h
27
//
MutableFst
. If A transduces string x to y with weight a, then the
36
void Reverse(const Fst<Arc> &ifst,
MutableFst
<RevArc> *ofst) {
rmfinalepsilon.h
31
void RmFinalEpsilon(
MutableFst
<A>* fst) {
topsort.h
86
bool TopSort(
MutableFst
<Arc> *fst) {
arcsort.h
43
void ArcSort(
MutableFst
<Arc> *fst, Compare comp) {
49
for (StateIterator<
MutableFst
<Arc> > siter(*fst);
54
for (ArcIterator<
MutableFst
<Arc> > aiter(*fst, s);
difference.h
117
// the difference to an output
MutableFst
. Only strings that are in
129
MutableFst
<Arc> *ofst,
intersect.h
119
MutableFst
<Arc> *ofst,
relabel.h
43
MutableFst
<A> *fst,
62
for (StateIterator<
MutableFst
<A> > siter(*fst);
65
for (MutableArcIterator<
MutableFst
<A> > aiter(fst, s);
99
void Relabel(
MutableFst
<A> *fst,
minimize.h
442
const Partition<typename A::StateId>& partition,
MutableFst
<A>* fst) {
456
for (MutableArcIterator<
MutableFst
<A> > aiter(fst, s);
474
void AcceptorMinimize(
MutableFst
<A>* fst) {
514
void Minimize(
MutableFst
<A>* fst,
MutableFst
<A>* sfst = 0) {
map.h
81
void Map(
MutableFst
<A> *fst, C* mapper) {
98
for (MutableArcIterator<
MutableFst
<A> > aiter(fst, s);
149
void Map(
MutableFst
<A> *fst, C mapper) {
156
// input Fst to an output
MutableFst
.
158
void Map(const Fst<A> &ifst,
MutableFst
<B> *ofst, C* mapper) {
229
// Fst to an output
MutableFst
.
231
void Map(const Fst<A> &ifst,
MutableFst
<B> *ofst, C mapper) {
766
GallicToNewSymbolsMapper(
MutableFst
<ToArc> *fst)
840
MutableFst
<ToArc> *fst_;
shortest-path.h
62
MutableFst
<Arc> *ofst,
228
void ShortestPath(const Fst<Arc> &ifst,
MutableFst
<Arc> *ofst,
351
void ShortestPath(const Fst<Arc> &ifst,
MutableFst
<Arc> *ofst,
concat.h
30
// modifies its
MutableFst
argument. If FST1 transduces string x to y
39
void Concat(
MutableFst
<Arc> *fst1, const Fst<Arc> &fst2) {
union.h
37
void Union(
MutableFst
<Arc> *fst1, const Fst<Arc> &fst2) {
encode.h
320
void Encode(
MutableFst
<A> *fst, EncodeMapper<A>* mapper) {
326
void Decode(
MutableFst
<A>* fst, const EncodeMapper<A>& mapper) {
Completed in 525 milliseconds
1
2