/external/openfst/src/include/fst/ |
const-fst.h | 1 // const-fst.h 19 // Simple concrete immutable FST whose states and arcs are each stored 29 #include <fst/expanded-fst.h> 30 #include <fst/fst-decl.h> // For optional argument declarations 31 #include <fst/test-properties.h> 32 #include <fst/util.h> 35 namespace fst { namespace 69 explicit ConstFstImpl(const Fst<A> &fst) [all...] |
edit-fst.h | 17 // An \ref Fst implementation that allows non-destructive edit operations on an 18 // existing fst. 26 #include <fst/cache.h> 28 namespace fst { namespace 32 // level: if a user has an underlying fst on which he or she wants to perform a 37 // added, and one may add transitions from existing nodes of the wrapped fst to 40 // N.B.: The documentation for Fst::Copy(true) says that its behavior is 41 // undefined if invoked on an fst that has already been accessed. This class 42 // requires that the Fst implementation it wraps provides consistent, reliable 53 // required by Fst::Copy(true) [all...] |
arc-map.h | 33 #include <fst/cache.h> 34 #include <fst/mutable-fst.h> 37 namespace fst { namespace 53 // not the empty Fst). 62 // Symbols should be copied from the input FST by the map. 89 // // This specifies the known properties of an Fst mapped by this 90 // // mapper. It takes as argument the input Fst's known properties. 97 // method to set the result Fst properties. 101 // new result Fst, or is an on-the-fly Fst. Another dimension is ho [all...] |
shortest-path.h | 19 // Functions to find shortest paths in an FST. 30 #include <fst/cache.h> 31 #include <fst/determinize.h> 32 #include <fst/queue.h> 33 #include <fst/shortest-distance.h> 34 #include <fst/test-properties.h> 37 namespace fst { namespace 51 // only when all the weights in the FST are between 78 void SingleShortestPath(const Fst<Arc> &ifst, 155 for (ArcIterator< Fst<Arc> > aiter(ifst, s) [all...] |
invert.h | 19 // Functions and classes to invert an Fst. 24 #include <fst/arc-map.h> 25 #include <fst/mutable-fst.h> 28 namespace fst { namespace 48 // Inverts the transduction corresponding to an FST by exchanging the 49 // FST's input and output labels. This version modifies its input. 56 void Invert(MutableFst<Arc> *fst) { 57 SymbolTable *input = fst->InputSymbols() ? fst->InputSymbols()->Copy() : 0 [all...] |
project.h | 19 // Functions and classes to project an Fst on to its domain or range. 24 #include <fst/arc-map.h> 25 #include <fst/mutable-fst.h> 28 namespace fst { namespace 68 // Projects an FST onto its domain or range by either copying each arcs' 77 void Project(MutableFst<Arc> *fst, ProjectType project_type) { 78 ArcMap(fst, ProjectMapper<Arc>(project_type)); 80 fst->SetOutputSymbols(fst->InputSymbols()) [all...] |
accumulator.h | 32 #include <fst/arcfilter.h> 33 #include <fst/arcsort.h> 34 #include <fst/dfs-visit.h> 35 #include <fst/expanded-fst.h> 36 #include <fst/replace.h> 38 namespace fst { namespace 52 void Init(const Fst<A>& fst, bool copy = false) {} 91 void Init(const Fst<A>& fst, bool copy = false) { [all...] |
push.h | 19 // Class to reweight/push an FST. 27 #include <fst/factor-weight.h> 28 #include <fst/fst.h> 29 #include <fst/arc-map.h> 30 #include <fst/reweight.h> 31 #include <fst/shortest-distance.h> 34 namespace fst { namespace 45 const Fst<Arc> &fst, [all...] |
factor-weight.h | 19 // Classes to factor weights in an FST. 28 #include <fst/slist.h> 35 #include <fst/cache.h> 36 #include <fst/test-properties.h> 39 namespace fst { namespace 184 FactorWeightFstImpl(const Fst<A> &fst, const FactorWeightOptions<A> &opts) 186 fst_(fst.Copy()), 192 uint64 props = fst.Properties(kFstProperties, false); 195 SetInputSymbols(fst.InputSymbols()) [all...] |
vector-fst.h | 1 // vector-fst.h 19 // Simple concrete, mutable FST whose states and arcs are stored in STL 29 #include <fst/mutable-fst.h> 30 #include <fst/test-properties.h> 33 namespace fst { namespace 40 // State definition. This does not manage the Fst properties. 180 // manages Fst properties and the # of input and output epsilons. 205 explicit VectorFstImpl(const Fst<A> &fst); [all...] |
prune.h | 27 #include <fst/arcfilter.h> 28 #include <fst/heap.h> 29 #include <fst/shortest-distance.h> 32 namespace fst { namespace 91 // options class as an argment. Delete states and arcs in 'fst' that 100 void Prune(MutableFst<Arc> *fst, 110 fst->SetProperties(kError, kError); 113 StateId ns = fst->NumStates(); 119 ShortestDistance(*fst, &tmp, true, opts.delta); 124 (fdistance->size() <= fst->Start()) | [all...] |
queue.h | 19 // Functions and classes for various Fst state queues with 29 #include <fst/arcfilter.h> 30 #include <fst/connect.h> 31 #include <fst/heap.h> 32 #include <fst/topsort.h> 35 namespace fst { namespace 42 // // Ctr: may need args (e.g., Fst, comparator) for some queues 310 // States are ordered in the queue topologically. The FST must be acyclic. 320 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter [all...] |
encode.h | 19 // Class to encode and decoder an fst. 32 #include <fst/arc-map.h> 33 #include <fst/rmfinalepsilon.h> 36 namespace fst { namespace 288 // Fst is useful for performing classical determinization or minimization 466 void Encode(MutableFst<A> *fst, EncodeMapper<A>* mapper) { 467 mapper->SetInputSymbols(fst->InputSymbols()); 468 mapper->SetOutputSymbols(fst->OutputSymbols()); 469 ArcMap(fst, mapper); 473 void Decode(MutableFst<A>* fst, const EncodeMapper<A>& mapper) [all...] |
add-on.h | 19 // Fst implementation class to attach an arbitrary object with a 20 // read/write method to an FST and its file rep. The FST is given a 29 #include <fst/fst.h> 32 namespace fst { namespace 34 // Identifies stream data as an add-on fst. 139 // Add to an Fst F a type T object. T must have a 'T* Read(istream &)', 141 // and 'int DecrRefCount()' methods (e.g. 'MatcherData' in matcher-fst.h). 142 // The result is a new Fst implemenation with type name 'type' 221 F *fst = F::Read(strm, fopts); local [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
queue.h | 18 // Functions and classes for various Fst state queues with 27 #include "fst/lib/arcfilter.h" 28 #include "fst/lib/connect.h" 29 #include "fst/lib/heap.h" 30 #include "fst/lib/topsort.h" 32 namespace fst { namespace 39 // // Ctr: may need args (e.g., Fst, comparator) for some queues 280 // States are ordered in the queue topologically. The FST must be acyclic. 291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter [all...] |
connect.h | 17 // Classes and functions to remove unsuccessful paths from an Fst. 22 #include "fst/lib/mutable-fst.h" 24 namespace fst { namespace 50 void InitVisit(const Fst<A> &fst) { 64 fst_ = &fst; 65 start_ = fst.Start(); 182 const Fst<A> *fst_; 194 // Trims an FST, removing states and arcs that are not on successfu [all...] |
encode.h | 17 // Class to encode and decoder an fst. 22 #include "fst/lib/map.h" 23 #include "fst/lib/rmfinalepsilon.h" 25 namespace fst { namespace 188 // Fst is useful for performing classical determinization or minimization 320 void Encode(MutableFst<A> *fst, EncodeMapper<A>* mapper) { 321 Map(fst, mapper); 326 void Decode(MutableFst<A>* fst, const EncodeMapper<A>& mapper) { 327 Map(fst, EncodeMapper<A>(mapper, DECODE)); 328 RmFinalEpsilon(fst); [all...] |
vector-fst.h | 1 // vector-fst.h 17 // Simple concrete, mutable FST whose states and arcs are stored in STL 26 #include "fst/lib/mutable-fst.h" 27 #include "fst/lib/test-properties.h" 29 namespace fst { namespace 34 // State definition. This does not manage the Fst properties. 174 // manages Fst properties and the # of input and output epsilons. 196 explicit VectorFstImpl(const Fst<A> &fst); [all...] |
/external/openfst/src/include/fst/extensions/far/ |
print-strings.h | 29 #include <fst/extensions/far/far.h> 30 #include <fst/string.h> 32 namespace fst { namespace 85 const Fst<Arc> &fst = far_reader->GetFst(); local 88 string_printer(fst, &str); 124 } // namespace fst
|
/external/openfst/src/include/fst/script/ |
draw.h | 20 #include <fst/script/arg-packs.h> 21 #include <fst/script/fst-class.h> 22 #include <fst/script/draw-impl.h> 26 namespace fst { namespace 34 const FstClass &fst; member in struct:fst::script::FstDrawerArgs 52 FstDrawerArgs(const FstClass &fst, 69 fst(fst), isyms(isyms), osyms(osyms), ssyms(ssyms), accep(accep), 79 const Fst<Arc> &fst = *(args->fst.GetFst<Arc>()) local [all...] |
shortest-path.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/shortest-path.h> 27 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions 29 namespace fst { namespace 33 : public fst::script::ShortestDistanceOptions { 43 float d = fst::kDelta, bool fp = false, 44 WeightClass w = fst::script::WeightClass::Zero() [all...] |
/external/openfst/src/include/fst/extensions/pdt/ |
expand.h | 19 // Expand a PDT to an FST. 27 #include <fst/extensions/pdt/pdt.h> 28 #include <fst/extensions/pdt/paren.h> 29 #include <fst/extensions/pdt/shortest-path.h> 30 #include <fst/extensions/pdt/reverse.h> 31 #include <fst/cache.h> 32 #include <fst/mutable-fst.h> 33 #include <fst/queue.h> 34 #include <fst/state-table.h 37 namespace fst { namespace [all...] |
shortest-path.h | 24 #include <fst/shortest-path.h> 25 #include <fst/extensions/pdt/paren.h> 26 #include <fst/extensions/pdt/pdt.h> 38 namespace fst { namespace 363 // as an FST). It is a generalization of the classic SSSP graph 393 PdtShortestPath(const Fst<Arc> &ifst, 467 Fst<Arc> *ifst_; 504 for (StateIterator<Fst<Arc> > siter(*ifst_); !siter.Done(); siter.Next()) { 506 for (ArcIterator<Fst<Arc> > aiter(*ifst_, s); 570 for (ArcIterator< Fst<Arc> > aiter(*ifst_, s.state) [all...] |
paren.h | 34 #include <fst/extensions/pdt/pdt.h> 35 #include <fst/extensions/pdt/collection.h> 36 #include <fst/fst.h> 37 #include <fst/dfs-visit.h> 40 namespace fst { namespace 87 // Creates an FST-style iterator from STL map and iterator. 143 PdtParenReachable(const Fst<A> &fst, 145 : fst_(fst), [all...] |
/external/openfst/src/test/ |
fst_test.cc | 19 // Regression test for FST classes. 23 #include <fst/compact-fst.h> 24 #include <fst/const-fst.h> 25 #include <fst/edit-fst.h> 26 #include <fst/matcher-fst.h> 29 namespace fst { namespace [all...] |