| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| test-properties.h | 26 #include "fst/lib/connect.h"
27 #include "fst/lib/dfs-visit.h"
28 #include "fst/lib/mutable-fst.h"
32 namespace fst { namespace
62 // Computes FST property values defined in properties.h. The value of
70 // If 'use_stored' is true, pre-computed FST properties may be used
72 // is used to implement fst.Properties(mask, true).
74 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known
[all...] |
| factor-weight.h | 18 // Classes to factor weights in an FST.
30 #include "fst/lib/cache.h"
31 #include "fst/lib/test-properties.h"
33 namespace fst { namespace
162 FactorWeightFstImpl(const Fst<A> &fst, const FactorWeightOptions &opts)
163 : CacheImpl<A>(opts), fst_(fst.Copy()), delta_(opts.delta),
166 uint64 props = fst.Properties(kFstProperties, false);
169 SetInputSymbols(fst.InputSymbols());
170 SetOutputSymbols(fst.OutputSymbols())
[all...] |
| synchronize.h | 18 // Synchronize an FST with bounded delay.
28 #include "fst/lib/cache.h"
29 #include "fst/lib/test-properties.h"
31 namespace fst { namespace
72 SynchronizeFstImpl(const Fst<A> &fst, const SynchronizeFstOptions &opts)
73 : CacheImpl<A>(opts), fst_(fst.Copy()) {
75 uint64 props = fst.Properties(kFstProperties, false);
78 SetInputSymbols(fst.InputSymbols());
79 SetOutputSymbols(fst.OutputSymbols())
[all...] |
| const-fst.h | 1 // const-fst.h
17 // Simple concrete immutable FST whose states and arcs are each stored
23 #include "fst/lib/expanded-fst.h"
24 #include "fst/lib/test-properties.h"
26 namespace fst { namespace
49 explicit ConstFstImpl(const Fst<A> &fst);
99 // Properties always true of this Fst class
111 size_t narcs_; // Number of arcs (per FST)
[all...] |
| fst.h | 0 // fst.h
17 // Finite-State Transducer (FST) - abstract base class definition,
23 #include "fst/lib/arc.h"
24 #include "fst/lib/compat.h"
25 #include "fst/lib/properties.h"
26 #include "fst/lib/register.h"
27 #include "fst/lib/symbol-table.h"
28 #include "fst/lib/util.h"
30 namespace fst { namespace
38 const FstHeader *header; // Pointer to Fst header (if non-zero
[all...] |
| mutable-fst.h | 1 // mutable-fst.h
17 // Expanded FST augmented with mutators - interface class definition
25 #include "fst/lib/expanded-fst.h"
27 namespace fst { namespace
31 // An expanded FST plus mutators (use MutableArcIterator to modify arcs).
39 virtual MutableFst<A> &operator=(const Fst<A> &fst) = 0;
89 LOG(ERROR) << "MutableFst::Read: Unknown FST type \"" << hdr.FstType()
94 Fst<A> *fst = reader(strm, ropts) local
[all...] |
| rmepsilon.h | 28 #include "fst/lib/arcfilter.h"
29 #include "fst/lib/cache.h"
30 #include "fst/lib/connect.h"
31 #include "fst/lib/factor-weight.h"
32 #include "fst/lib/invert.h"
33 #include "fst/lib/map.h"
34 #include "fst/lib/queue.h"
35 #include "fst/lib/shortest-distance.h"
36 #include "fst/lib/topsort.h"
38 namespace fst { namespace
[all...] |
| project.h | 17 // Functions and classes to project an Fst on to its domain or range.
22 #include "fst/lib/map.h"
23 #include "fst/lib/mutable-fst.h"
25 namespace fst { namespace
54 // Projects an FST onto its domain or range by either copying each arcs'
63 void Project(MutableFst<Arc> *fst, ProjectType project_type) {
64 Map(fst, ProjectMapper<Arc>(project_type));
68 // Projects an FST onto its domain or range by either copying each arc's
70 // Fst
[all...] |
| push.h | 18 // Class to reweight/push an FST.
23 #include "fst/lib/factor-weight.h"
24 #include "fst/lib/fst.h"
25 #include "fst/lib/map.h"
26 #include "fst/lib/reweight.h"
27 #include "fst/lib/shortest-distance.h"
29 namespace fst { namespace
31 // Pushes the weights in FST in the direction defined by TYPE. If
41 void Push(MutableFst<Arc> *fst, ReweightType type)
[all...] |
| topsort.h | 25 #include "fst/lib/dfs-visit.h"
26 #include "fst/lib/fst.h"
27 #include "fst/lib/statesort.h"
29 namespace fst { namespace
39 // otherwise unchanged. ACYCLIC will be true iff the FST has
44 void InitVisit(const Fst<A> &fst) {
86 bool TopSort(MutableFst<Arc> *fst) {
93 DfsVisit(*fst, &top_order_visitor)
[all...] |
| shortest-path.h | 18 // Functions to find shortest paths in an FST.
25 #include "fst/lib/cache.h"
26 #include "fst/lib/queue.h"
27 #include "fst/lib/shortest-distance.h"
28 #include "fst/lib/test-properties.h"
30 namespace fst { namespace
61 void SingleShortestPath(const Fst<Arc> &ifst,
112 for (ArcIterator< Fst<Arc> > aiter(ifst, s);
228 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
255 // Algorithm works on the reverse of 'fst' : 'rfst' 'distance' i
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| pdtscript.h | 27 #include <fst/compose.h> // for ComposeOptions
28 #include <fst/util.h>
30 #include <fst/script/fst-class.h>
31 #include <fst/script/arg-packs.h>
32 #include <fst/script/shortest-path.h>
34 #include <fst/extensions/pdt/compose.h>
35 #include <fst/extensions/pdt/expand.h>
36 #include <fst/extensions/pdt/info.h>
37 #include <fst/extensions/pdt/replace.h
42 namespace fst { namespace
100 const Fst<Arc> &fst = *(args->arg1.GetFst<Arc>()); local
168 const Fst<Arc> &fst = *(args->arg1.GetFst<Arc>()); local
208 const Fst<Arc> &fst = *(args->arg1.GetFst<Arc>()); local
259 const Fst<Arc> &fst = *(args->arg1.GetFst<Arc>()); local
[all...] |
| /external/openfst/src/include/fst/script/ |
| info-impl.h | 28 #include <fst/connect.h>
29 #include <fst/dfs-visit.h>
30 #include <fst/fst.h>
31 #include <fst/lookahead-matcher.h>
32 #include <fst/matcher.h>
33 #include <fst/queue.h>
34 #include <fst/test-properties.h>
35 #include <fst/verify.h>
36 #include <fst/visit.h
38 namespace fst { namespace
[all...] |
| prune.h | 23 #include <fst/script/arg-packs.h>
24 #include <fst/script/fst-class.h>
25 #include <fst/script/weight-class.h>
26 #include <fst/prune.h>
27 #include <fst/arcfilter.h>
29 namespace fst { namespace
48 // converts a script::PruneOptions into a fst::PruneOptions.
54 fst::PruneOptions<A, AnyArcFilter<A> > ConvertPruneOptions(
70 return fst::PruneOptions<A, AnyArcFilter<A> >
125 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local
[all...] |
| randgen.h | 20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/randgen.h>
24 namespace fst { namespace
38 const Fst<Arc> &ifst = *(args->arg1.GetFst<Arc>());
68 fst::RandGenOptions<fst::script::RandArcSelection>(
69 fst::script::UNIFORM_ARC_SELECTOR));
72 } // namespace fst
[all...] |
| /external/openfst/src/include/fst/ |
| compose.h | 29 #include <fst/cache.h>
30 #include <fst/compose-filter.h>
31 #include <fst/lookahead-filter.h>
32 #include <fst/matcher.h>
33 #include <fst/state-table.h>
34 #include <fst/test-properties.h>
37 namespace fst { namespace
44 // version controls composition implemented between generic Fst<Arc>
45 // types and a shared matcher type M for Fst<Arc>. This should be
49 class M = Matcher<Fst<A> >
[all...] |
| synchronize.h | 19 // Synchronize an FST with bounded delay.
37 #include <fst/cache.h>
38 #include <fst/test-properties.h>
41 namespace fst { namespace
85 SynchronizeFstImpl(const Fst<A> &fst, const SynchronizeFstOptions &opts)
86 : CacheImpl<A>(opts), fst_(fst.Copy()) {
88 uint64 props = fst.Properties(kFstProperties, false);
91 SetInputSymbols(fst.InputSymbols());
92 SetOutputSymbols(fst.OutputSymbols())
[all...] |
| rmepsilon.h | 27 #include <fst/slist.h>
35 #include <fst/arcfilter.h>
36 #include <fst/cache.h>
37 #include <fst/connect.h>
38 #include <fst/factor-weight.h>
39 #include <fst/invert.h>
40 #include <fst/prune.h>
41 #include <fst/queue.h>
42 #include <fst/shortest-distance.h>
43 #include <fst/topsort.h
46 namespace fst { namespace
[all...] |
| compact-fst.h | 1 // compact-fst.h
20 // FST Class for memory-efficient representation of common types of
32 #include <fst/cache.h>
33 #include <fst/expanded-fst.h>
34 #include <fst/fst-decl.h> // For optional argument declarations
35 #include <fst/matcher.h>
36 #include <fst/test-properties.h>
37 #include <fst/util.h
40 namespace fst { namespace
[all...] |
| connect.h | 19 // Classes and functions to remove unsuccessful paths from an Fst.
27 #include <fst/dfs-visit.h>
28 #include <fst/union-find.h>
29 #include <fst/mutable-fst.h>
32 namespace fst { namespace
59 void InitVisit(const Fst<A> &fst) { }
140 void InitVisit(const Fst<A> &fst);
[all...] |
| topsort.h | 29 #include <fst/dfs-visit.h>
30 #include <fst/fst.h>
31 #include <fst/statesort.h>
34 namespace fst { namespace
44 // otherwise unchanged. ACYCLIC will be true iff the FST has
49 void InitVisit(const Fst<A> &fst) {
91 bool TopSort(MutableFst<Arc> *fst) {
98 DfsVisit(*fst, &top_order_visitor)
[all...] |
| determinize.h | 20 // Functions and classes to determinize an FST.
31 #include <fst/slist.h>
36 #include <fst/cache.h>
37 #include <fst/factor-weight.h>
38 #include <fst/arc-map.h>
39 #include <fst/prune.h>
40 #include <fst/test-properties.h>
43 namespace fst { namespace
152 DeterminizeFstImplBase(const Fst<A> &fst,
[all...] |
| string.h | 26 #include <fst/compact-fst.h>
27 #include <fst/mutable-fst.h>
31 namespace fst { namespace
33 // Functor compiling a string in an FST
49 // Compile string 's' into FST 'fst'.
51 bool operator()(const string &s, F *fst) {
55 Compile(labels, fst);
[all...] |
| matcher-fst.h | 1 // matcher-fst.h
19 // Class to add a matcher to an FST.
24 #include <fst/add-on.h>
25 #include <fst/const-fst.h>
26 #include <fst/lookahead-matcher.h>
29 namespace fst { namespace
42 // Matcher(const F &fst, MatchType type, MatcherData *data);
70 typedef AddOnImpl<typename M::FST, D> Impl;
74 // Class to add a matcher M to an Fst F. Creates a new Fst of type name N
[all...] |
| lookahead-filter.h | 28 #include <fst/fst.h>
29 #include <fst/lookahead-matcher.h>
32 namespace fst { namespace
59 // Fst's default matchers.
61 MatchType LookAheadMatchType(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {
62 LookAheadMatcher< Fst <Arc> > matcher1(fst1, MATCH_OUTPUT);
63 LookAheadMatcher< Fst <Arc> > matcher2(fst2, MATCH_INPUT);
69 // distinct FST and matcher types w/o using a common base class. Thi
[all...] |
