Searched refs:fst (Results 226 - 250 of 404) sorted by relevance

1234567891011>>

/external/openfst/src/include/fst/
H A Dcomplement.h29 #include <fst/fst.h>
30 #include <fst/test-properties.h>
33 namespace fst { namespace
63 explicit ComplementFstImpl(const Fst<A> &fst) : fst_(fst.Copy()) { argument
65 uint64 props = fst.Properties(kILabelSorted, false);
67 SetInputSymbols(fst.InputSymbols());
68 SetOutputSymbols(fst.OutputSymbols());
129 void operator=(const ComplementFstImpl<A> &fst); // Disallo
152 ComplementFst(const Fst<A> &fst) argument
163 ComplementFst(const ComplementFst<A> &fst, bool safe = false) argument
197 StateIterator(const ComplementFst<A> &fst) argument
240 ArcIterator(const ComplementFst<A> &fst, StateId s) argument
[all...]
H A Drational.h30 #include <fst/mutable-fst.h>
31 #include <fst/replace.h>
32 #include <fst/test-properties.h>
35 namespace fst { namespace
47 template <class A> void Closure(RationalFst<A> *fst, ClosureType closure_type);
164 // Implementation of ClosureFst(fst, closure_type)
165 void InitClosure(const Fst<A> &fst, ClosureType closure_type) { argument
168 uint64 props = fst.Properties(kFstProperties, false);
169 SetInputSymbols(fst
193 AddUnion(const Fst<A> &fst) argument
211 AddConcat(const Fst<A> &fst, bool append) argument
312 StateIterator(const RationalFst<A> &fst) argument
324 ArcIterator(const RationalFst<A> &fst, StateId s) argument
[all...]
H A Dshortest-distance.h29 #include <fst/arcfilter.h>
30 #include <fst/cache.h>
31 #include <fst/queue.h>
32 #include <fst/reverse.h>
33 #include <fst/test-properties.h>
36 namespace fst { namespace
67 // (e.g., in epsilon removal). Contrary to usual conventions, 'fst'
78 const Fst<Arc> &fst,
82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue),
245 const Fst<Arc> &fst,
77 ShortestDistanceState( const Fst<Arc> &fst, vector<Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, bool retain) argument
244 ShortestDistance( const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts) argument
281 ShortestDistance(const Fst<Arc> &fst, vector<typename Arc::Weight> *distance, bool reverse = false, float delta = kDelta) argument
323 ShortestDistance(const Fst<Arc> &fst, float delta = kDelta) argument
[all...]
H A Dlookahead-matcher.h25 #include <fst/add-on.h>
26 #include <fst/const-fst.h>
27 #include <fst/fst.h>
28 #include <fst/label-reachable.h>
29 #include <fst/matcher.h>
35 namespace fst { namespace
50 // LookAheadMatcher(const F &fst, MatchType match_type);
72 // bool LookAheadFst(const Fst<Arc>& fst, StateI
148 LookAheadFst(const Fst<Arc> &fst, StateId s) argument
193 TrivialLookAheadMatcher(const FST &fst, MatchType match_type) argument
219 LookAheadFst(const Fst<Arc> &fst, StateId s) argument
222 InitLookAheadFst(const Fst<Arc>& fst, bool copy = false) argument
236 LookAheadFst_(const Fst<Arc> &fst, StateId s) argument
265 ArcLookAheadMatcher(const FST &fst, MatchType match_type, MatcherData *data = 0) argument
312 InitLookAheadFst(const Fst<Arc>& fst, bool copy = false) argument
327 LookAheadFst_(const Fst<Arc> &fst, StateId s) argument
338 LookAheadFst(const Fst<Arc> &fst, StateId s) argument
438 LabelLookAheadMatcher(const FST &fst, MatchType match_type, MatcherData *data = 0, S *s = 0) argument
544 InitLookAheadFst(const Fst<Arc>& fst, bool copy = false) argument
551 InitLookAheadFst(const L& fst, bool copy = false) argument
568 LookAheadFst_(const Fst<Arc> &fst, StateId s) argument
583 LookAheadFst(const L &fst, StateId s) argument
639 Relabel(MutableFst<A> *fst, const L &mfst, bool relabel_input) argument
667 Fst<A> &fst = (*impl)->GetFst(); local
717 LookAheadMatcher(const F &fst, MatchType match_type) argument
758 LookAheadFst(const Fst<Arc> &fst, StateId s) argument
785 InitLookAheadFst(const Fst<Arc>& fst, bool copy = false) argument
[all...]
H A Dmutable-fst.h1 // mutable-fst.h
32 #include <fst/expanded-fst.h>
35 namespace fst { namespace
47 virtual MutableFst<A> &operator=(const Fst<A> &fst) = 0;
49 MutableFst<A> &operator=(const MutableFst<A> &fst) { argument
50 return operator=(static_cast<const Fst<A> &>(fst));
111 Fst<A> *fst = reader(strm, ropts); local
112 if (!fst) return 0;
113 return static_cast<MutableFst<A> *>(fst);
193 MutableArcIterator(F *fst, StateId s) argument
220 Final(const MutableFst<A> &fst, typename A::StateId s) argument
225 NumArcs(const MutableFst<A> &fst, typename A::StateId s) argument
230 NumInputEpsilons(const MutableFst<A> &fst, typename A::StateId s) argument
235 NumOutputEpsilons(const MutableFst<A> &fst, typename A::StateId s) argument
352 ImplToMutableFst(const ImplToMutableFst<I, F> &fst) argument
355 ImplToMutableFst(const ImplToMutableFst<I, F> &fst, bool safe) argument
368 operator =(const Fst<Arc> &fst) argument
[all...]
H A Dintersect.h28 #include <fst/cache.h>
29 #include <fst/compose.h>
32 namespace fst { namespace
94 IntersectFst(const IntersectFst<A> &fst, bool safe = false) : argument
95 ComposeFst<A>(fst, safe) {}
109 explicit StateIterator(const IntersectFst<A> &fst) argument
110 : StateIterator< ComposeFst<A> >(fst) {}
121 ArcIterator(const IntersectFst<A> &fst, StateId s) argument
122 : ArcIterator< ComposeFst<A> >(fst, s) {}
170 } // namespace fst
[all...]
H A Dvisit.h26 #include <fst/arcfilter.h>
27 #include <fst/mutable-fst.h>
30 namespace fst { namespace
47 // void InitVisit(const Fst<Arc> &fst);
69 void Visit(const Fst<Arc> &fst, V *visitor, Q *queue, ArcFilter filter) { argument
74 visitor->InitVisit(fst);
76 StateId start = fst.Start();
95 if (fst.Properties(kExpanded, false)) { // tests if expanded case, then
96 nstates = CountStates(fst); // use
189 Visit(const Fst<Arc> &fst, V *visitor, Q* queue) argument
[all...]
H A Dencode.h19 // Class to encode and decoder an fst.
32 #include <fst/arc-map.h>
33 #include <fst/rmfinalepsilon.h>
36 namespace fst { namespace
466 void Encode(MutableFst<A> *fst, EncodeMapper<A>* mapper) { argument
467 mapper->SetInputSymbols(fst->InputSymbols());
468 mapper->SetOutputSymbols(fst->OutputSymbols());
469 ArcMap(fst, mapper);
473 void Decode(MutableFst<A>* fst, const EncodeMapper<A>& mapper) { argument
474 ArcMap(fst, EncodeMappe
495 EncodeFst(const Fst<A> &fst, EncodeMapper<A>* encoder) argument
501 EncodeFst(const Fst<A> &fst, const EncodeMapper<A>& encoder) argument
505 EncodeFst(const EncodeFst<A> &fst, bool copy = false) argument
533 DecodeFst(const Fst<A> &fst, const EncodeMapper<A>& encoder) argument
542 DecodeFst(const DecodeFst<A> &fst, bool safe = false) argument
557 StateIterator(const EncodeFst<A> &fst) argument
567 ArcIterator(const EncodeFst<A> &fst, typename A::StateId s) argument
577 StateIterator(const DecodeFst<A> &fst) argument
587 ArcIterator(const DecodeFst<A> &fst, typename A::StateId s) argument
[all...]
H A Dlock.h26 #include <fst/compat.h> // for DISALLOW_COPY_AND_ASSIGN
28 namespace fst { namespace
90 } // namespace fst
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Drelabel.h24 #include "fst/lib/cache.h"
25 #include "fst/lib/test-properties.h"
28 namespace fst { namespace
36 // \param fst input fst, must be mutable
42 MutableFst<A> *fst,
48 uint64 props = fst->Properties(kFstProperties, false);
61 for (StateIterator<MutableFst<A> > siter(*fst);
64 for (MutableArcIterator<MutableFst<A> > aiter(fst, s);
82 fst
41 Relabel( MutableFst<A> *fst, const vector<pair<typename A::Label, typename A::Label> >& ipairs, const vector<pair<typename A::Label, typename A::Label> >& opairs) argument
98 Relabel(MutableFst<A> *fst, const SymbolTable* new_isymbols, const SymbolTable* new_osymbols) argument
163 RelabelFstImpl(const Fst<A>& fst, const vector<pair<Label, Label> >& ipairs, const vector<pair<Label, Label> >& opairs, const RelabelFstOptions &opts) argument
190 RelabelFstImpl(const Fst<A>& fst, const SymbolTable* new_isymbols, const SymbolTable* new_osymbols, const RelabelFstOptions &opts) argument
328 RelabelFst(const Fst<A>& fst, const vector<pair<Label, Label> >& ipairs, const vector<pair<Label, Label> >& opairs) argument
333 RelabelFst(const Fst<A>& fst, const vector<pair<Label, Label> >& ipairs, const vector<pair<Label, Label> >& opairs, const RelabelFstOptions &opts) argument
339 RelabelFst(const Fst<A>& fst, const SymbolTable* new_isymbols, const SymbolTable* new_osymbols) argument
345 RelabelFst(const Fst<A>& fst, const SymbolTable* new_isymbols, const SymbolTable* new_osymbols, const RelabelFstOptions &opts) argument
351 RelabelFst(const RelabelFst<A> &fst) argument
413 StateIterator(const RelabelFst<A> &fst) argument
448 ArcIterator(const RelabelFst<A> &fst, StateId s) argument
[all...]
H A Dregister.h0 // fst-register.h
28 #include "fst/lib/compat.h"
34 namespace fst { namespace
45 typedef Fst<A> *(*Converter)(const Fst<A> &fst);
91 string so_file = type + "-fst.so";
136 F fst; local
143 registr->SetEntry(fst.Type(), entry);
147 static Fst<Arc> *Convert(const Fst<Arc> &fst) { return new F(fst); } argument
153 static fst
158 Convert(const Fst<A> &fst, const string &ftype) argument
[all...]
H A Dtest-properties.h24 #include "fst/lib/connect.h"
25 #include "fst/lib/dfs-visit.h"
26 #include "fst/lib/mutable-fst.h"
30 namespace fst { namespace
70 // is used to implement fst.Properties(mask, true).
72 uint64 ComputeProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known, argument
78 uint64 fst_props = fst.Properties(kFstProperties, false); // Fst-stored
103 DfsVisit(fst, &scc_visitor);
119 for (StateIterator< Fst<Arc> > siter(fst);
227 TestProperties(const Fst<Arc> &fst, uint64 mask, uint64 *known) argument
[all...]
H A Drmepsilon.h26 #include "fst/lib/arcfilter.h"
27 #include "fst/lib/cache.h"
28 #include "fst/lib/connect.h"
29 #include "fst/lib/factor-weight.h"
30 #include "fst/lib/invert.h"
31 #include "fst/lib/map.h"
32 #include "fst/lib/queue.h"
33 #include "fst/lib/shortest-distance.h"
34 #include "fst/lib/topsort.h"
36 namespace fst { namespace
60 RmEpsilonState(const Fst<Arc> &fst, vector<Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
200 RmEpsilon(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions<Arc, Queue> &opts) argument
286 RmEpsilon(MutableFst<Arc> *fst, bool connect = true) argument
329 RmEpsilonFstImpl(const Fst<A>& fst, const RmEpsilonFstOptions &opts) argument
435 RmEpsilonFst(const Fst<A> &fst) argument
438 RmEpsilonFst(const Fst<A> &fst, const RmEpsilonFstOptions &opts) argument
441 RmEpsilonFst(const RmEpsilonFst<A> &fst) argument
506 StateIterator(const RmEpsilonFst<A> &fst) argument
518 ArcIterator(const RmEpsilonFst<A> &fst, StateId s) argument
[all...]
H A Dencode.h17 // Class to encode and decoder an fst.
22 #include "fst/lib/map.h"
23 #include "fst/lib/rmfinalepsilon.h"
25 namespace fst { namespace
321 void Encode(MutableFst<A> *fst, EncodeMapper<A>* mapper) { argument
322 Map(fst, mapper);
327 void Decode(MutableFst<A>* fst, const EncodeMapper<A>& mapper) { argument
328 Map(fst, EncodeMapper<A>(mapper, DECODE));
329 RmFinalEpsilon(fst);
345 EncodeFst(const Fst<A> &fst, EncodeMappe argument
348 EncodeFst(const Fst<A> &fst, const EncodeMapper<A>& encoder) argument
351 EncodeFst(const EncodeFst<A> &fst) argument
370 DecodeFst(const Fst<A> &fst, const EncodeMapper<A>& encoder) argument
375 DecodeFst(const EncodeFst<A> &fst) argument
387 StateIterator(const EncodeFst<A> &fst) argument
397 ArcIterator(const EncodeFst<A> &fst, typename A::StateId s) argument
407 StateIterator(const DecodeFst<A> &fst) argument
417 ArcIterator(const DecodeFst<A> &fst, typename A::StateId s) argument
[all...]
H A Dprune.h23 #include "fst/lib/arcfilter.h"
24 #include "fst/lib/shortest-distance.h"
26 namespace fst { namespace
51 // options class as an argment. Delete states and arcs in 'fst' that
56 void Prune(MutableFst<Arc> *fst, argument
67 StateId ns = fst->NumStates();
75 ShortestDistance(*fst, idistance, false);
82 ShortestDistance(*fst, fdistance, true);
88 dead.push_back(fst->AddState());
90 Weight ceiling = Times((*fdistance)[fst
128 Prune(MutableFst<Arc> *fst, typename Arc::Weight threshold) argument
[all...]
H A Drational.h23 #include "fst/lib/map.h"
24 #include "fst/lib/mutable-fst.h"
25 #include "fst/lib/replace.h"
26 #include "fst/lib/test-properties.h"
28 namespace fst { namespace
39 template <class A> void Closure(RationalFst<A> *fst, ClosureType closure_type);
107 // Implementation of ClosureFst(fst, closure_type)
108 void InitClosure(const Fst<A> &fst, ClosureType closure_type) { argument
109 uint64 props = fst
136 AddUnion(const Fst<A> &fst) argument
152 AddConcat(const Fst<A> &fst) argument
239 RationalFst(const RationalFst<A> &fst) argument
258 StateIterator(const RationalFst<A> &fst) argument
269 ArcIterator(const RationalFst<A> &fst, StateId s) argument
[all...]
H A Drandgen.h26 #include "fst/lib/mutable-fst.h"
28 namespace fst { namespace
48 size_t operator()(const Fst<A> &fst, StateId s) const { argument
50 size_t n = fst.NumArcs(s);
51 if (fst.Final(s) != Weight::Zero())
69 size_t operator()(const Fst<A> &fst, StateId s) const { argument
72 for (ArcIterator< Fst<A> > aiter(fst, s); !aiter.Done();
77 sum += exp(-fst.Final(s).Value());
82 for (ArcIterator< Fst<A> > aiter(fst,
[all...]
H A Dcomplement.h24 #include "fst/lib/fst.h"
25 #include "fst/lib/test-properties.h"
27 namespace fst { namespace
57 explicit ComplementFstImpl(const Fst<A> &fst) : fst_(fst.Copy()) { argument
59 uint64 props = fst.Properties(kILabelSorted, false);
61 SetInputSymbols(fst.InputSymbols());
62 SetOutputSymbols(fst.OutputSymbols());
118 explicit ComplementFst(const Fst<A> &fst) argument
126 ComplementFst(const ComplementFst<A> &fst) argument
189 StateIterator(const ComplementFst<A> &fst) argument
221 ArcIterator(const ComplementFst<A> &fst, StateId s) argument
[all...]
H A Dpush.h23 #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
41 void Push(MutableFst<Arc> *fst, ReweightType type) { argument
43 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL);
44 Reweight(fst, distanc
[all...]
/external/openfst/src/include/fst/extensions/pdt/
H A Dpdtscript.h27 #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/extension
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/
H A Drandequivalent.h20 #include <fst/script/arg-packs.h>
21 #include <fst/script/fst-class.h>
22 #include <fst/script/randgen.h> // for RandArcSelection
23 #include <fst/randequivalent.h>
25 namespace fst { namespace
88 float delta = fst::kDelta,
97 const fst::RandGenOptions<
98 fst::script::RandArcSelection> &opts);
101 } // namespace fst
[all...]
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/gas64/
H A Dgas-fp.asm9 fst %st(2) label
/external/openfst/src/extensions/pdt/
H A Dpdtscript.cc20 // See comments in nlp/fst/script/script-impl.h for how the registration
29 #include <fst/extensions/pdt/compose.h>
30 #include <fst/extensions/pdt/expand.h>
31 #include <fst/extensions/pdt/pdtscript.h>
32 #include <fst/extensions/pdt/replace.h>
33 #include <fst/extensions/pdt/reverse.h>
34 #include <fst/extensions/pdt/shortest-path.h>
35 #include <fst/script/script-impl.h>
37 namespace fst { namespace
115 } // namespace fst
[all...]
/external/srec/tools/test_g2g/
H A Dtest_g2g.c191 srec_context* fst; local
222 fst = syntax->synx;
225 fst->num_arcs, fst->num_base_arcs, fst->FSMarc_list_len,
226 fst->num_nodes, fst->num_base_nodes, fst->FSMnode_list_len,
227 fst->olabels->num_words, fst
[all...]
/external/openfst/src/include/fst/extensions/far/
H A Dfarscript.h27 #include <fst/script/arg-packs.h>
28 #include <fst/extensions/far/compile-strings.h>
29 #include <fst/extensions/far/create.h>
30 #include <fst/extensions/far/equal.h>
31 #include <fst/extensions/far/extract.h>
32 #include <fst/extensions/far/info.h>
33 #include <fst/extensions/far/print-strings.h>
34 #include <fst/extensions/far/far.h>
36 #include <fst/types.h>
38 namespace fst { namespace
[all...]

Completed in 1016 milliseconds

1234567891011>>