| /external/openfst/src/test/ |
| fst_test.h | 43 typedef typename F::Arc Arc;
44 typedef typename Arc::StateId StateId;
45 typedef typename Arc::Weight Weight;
46 typedef typename Arc::Label Label;
49 VectorFst<Arc> vfst;
80 const Arc &arc = aiter.Value(); local
81 CHECK_EQ(arc.ilabel, na);
82 CHECK_EQ(arc.olabel, 0)
137 Arc arc = aiter.Value(); local
[all...] |
| /external/skia/experimental/SkV8Example/ |
| Path2D.cpp | 51 ADD_METHOD("arc", Arc);
139 void Path2D::Arc(const v8::FunctionCallbackInfo<Value>& args) {
|
| /external/srec/tools/grxmlcompile/ |
| fst-io.h | 27 // on the arc type to support multiple and extensible arc types.
43 typedef A Arc;
100 PrintId(l, isyms_, "arc input label");
104 PrintId(l, osyms_, "arc output label");
112 Arc arc = aiter.Value(); local
115 PrintStateId(arc.nextstate);
117 PrintILabel(arc.ilabel);
120 PrintOLabel(arc.olabel)
239 Arc arc; local
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| arcsort.h | 42 template<class Arc, class Compare>
43 void ArcSort(MutableFst<Arc> *fst, Compare comp) {
44 typedef typename Arc::StateId StateId;
48 vector<Arc> arcs;
49 for (StateIterator< MutableFst<Arc> > siter(*fst);
54 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s);
190 typedef A Arc;
307 typedef StdArc Arc;
|
| complement.h | 38 // corresponds to input state s - 1. The first arc in the output at
113 typedef A Arc;
|
| const-fst.h | 31 // Arc definition.
80 // Provide information needed for the generic arc iterator
149 const A &arc = aiter.Value(); local
151 if (arc.ilabel == 0)
153 if (arc.olabel == 0)
155 arcs_[pos++] = arc;
229 typedef A Arc;
|
| encode.h | 46 // Encoded data consists of arc input/output labels and arc weight
108 // Given an arc encode either input/ouptut labels or input/costs or both
109 Label Encode(const A &arc) {
110 const Tuple tuple(arc.ilabel,
111 flags_ & kEncodeLabels ? arc.olabel : 0,
112 flags_ & kEncodeWeights ? arc.weight : Weight::One());
123 // Given an encode arc Label decode back to input/output labels and costs
231 A operator()(const A &arc) {
233 if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) |
[all...] |
| rational.h | 196 typedef A Arc;
|
| relabel.h | 66 A arc = aiter.Value(); local
71 input_map.find(arc.ilabel);
72 if (it != input_map.end()) {arc.ilabel = it->second; }
75 it = output_map.find(arc.olabel);
76 if (it != output_map.end()) { arc.olabel = it->second; }
78 aiter.SetValue(arc);
275 A arc = aiter.Value(); local
280 input_map_.find(arc.ilabel);
281 if (it != input_map_.end()) { arc.ilabel = it->second; }
287 output_map_.find(arc.olabel)
[all...] |
| cache.h | 53 // garbage collection of states (not in use in an arc iterator) is
61 using FstImpl<typename S::Arc>::Type;
66 typedef typename S::Arc Arc;
67 typedef typename Arc::Weight Weight;
68 typedef typename Arc::StateId StateId;
140 cache_first_state_->arcs.capacity() * sizeof(Arc);
170 void AddArc(StateId s, const Arc &arc) {
172 state->arcs.push_back(arc);
181 const Arc &arc = arcs[a]; local
[all...] |
| factor-weight.h | 145 typedef A Arc;
259 const A &arc = ait.Value(); local
260 Weight w = Times(e.weight, arc.weight);
263 StateId d = FindState(Element(arc.nextstate, Weight::One()));
264 this->AddArc(s, Arc(arc.ilabel, arc.olabel, w, d));
268 StateId d = FindState(Element(arc.nextstate,
270 this->AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d))
[all...] |
| queue.h | 286 // This constructor computes the top. order. It accepts an arc filter
289 template <class Arc, class ArcFilter>
291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter)
295 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);
504 template <class Arc, class ArcFilter>
505 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance,
507 typedef typename Arc::Weight Weight;
525 SccVisitor<Arc> scc_visitor(&scc_, 0, 0, &props);
615 template <class Arc, class ArcFilter, class Less
666 const Arc &arc = ait.Value(); local
[all...] |
| rmepsilon.h | 38 template <class Arc, class Queue>
40 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
41 typedef typename Arc::StateId StateId;
46 : ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> >(
47 q, EpsilonArcFilter<Arc>(), kNoStateId, d), connect(c) {}
53 template <class Arc, class Queue>
56 typedef typename Arc::Label Label;
57 typedef typename Arc::StateId StateId
152 Arc arc = ait.Value(); local
[all...] |
| synchronize.h | 51 typedef A Arc;
215 const A &arc = ait.Value(); local
216 if (!Empty(e.istring, arc.ilabel) && !Empty(e.ostring, arc.olabel)) {
217 const String *istring = Cdr(e.istring, arc.ilabel);
218 const String *ostring = Cdr(e.ostring, arc.olabel);
219 StateId d = FindState(Element(arc.nextstate, istring, ostring));
220 AddArc(s, Arc(Car(e.istring, arc.ilabel),
221 Car(e.ostring, arc.olabel), arc.weight, d))
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib-tk/ |
| Canvas.py | 89 class Arc(CanvasItem):
91 CanvasItem.__init__(self, canvas, 'arc', *args, **kw)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib-tk/ |
| Canvas.py | 89 class Arc(CanvasItem):
91 CanvasItem.__init__(self, canvas, 'arc', *args, **kw)
|
| /external/openfst/src/include/fst/ |
| compose-filter.h | 164 // typedef typename FST1::Arc Arc;
182 // // If an arc label to be matched is kNolabel, then that side
186 // FilterState FilterArc(Arc *arc1, Arc *arc2) const;
211 typedef typename FST1::Arc Arc;
216 typedef typename Arc::StateId StateId;
217 typedef typename Arc::Label Label;
218 typedef typename Arc::Weight Weight
[all...] |
| const-fst.h | 42 // Arc definition. The unsigned type U is used to represent indices into
43 // the arc array.
53 typedef A Arc;
100 // Provide information needed for the generic arc iterator
190 const A &arc = aiter.Value(); local
192 if (arc.ilabel == 0)
194 if (arc.olabel == 0)
196 arcs_[pos++] = arc;
255 // represent indices into the arc array (uint32 by default, declared
264 typedef A Arc;
402 const A &arc = aiter.Value(); local
[all...] |
| encode.h | 32 #include <fst/arc-map.h>
61 // Encoded data consists of arc input/output labels and arc weight
130 // Given an arc encode either input/ouptut labels or input/costs or both
131 Label Encode(const A &arc) {
132 const Tuple tuple(arc.ilabel,
133 flags_ & kEncodeLabels ? arc.olabel : 0,
134 flags_ & kEncodeWeights ? arc.weight : Weight::One());
145 // Given an arc, look up its encoded label. Returns kNoLabel if not found.
146 Label GetLabel(const A &arc) const
[all...] |
| factor-weight.h | 43 template <class Arc>
45 typedef typename Arc::Label Label;
47 uint32 mode; // factor arc weights and/or final weights
48 Label final_ilabel; // input label of arc created when factoring final w's
49 Label final_olabel; // output label of arc created when factoring final w's
168 typedef A Arc;
199 << "factoring neither arc weights nor final weights.";
270 return FstImpl<Arc>::Properties(mask);
312 const A &arc = ait.Value(); local
313 Weight w = Times(e.weight, arc.weight)
[all...] |
| label-reachable.h | 131 // an arc iterator, useful for FST composition. In particular,
133 // the transitions of the arc iterator, when iter_input is true
137 // With the arc iterator test of reachability, the begin position, end
138 // position and accumulated arc weight of the matches can be
139 // returned. The optional template argument controls how reachable arc
146 typedef A Arc;
154 : fst_(new VectorFst<Arc>(fst)),
211 void Relabel(MutableFst<Arc> *fst, bool relabel_input) {
212 for (StateIterator< MutableFst<Arc> > siter(*fst);
215 for (MutableArcIterator< MutableFst<Arc> > aiter(fst, s)
218 Arc arc = aiter.Value(); local
327 const A &arc = aiter->Value(); local
420 Arc arc = aiter.Value(); local
[all...] |
| lookahead-filter.h | 60 template <class Arc>
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);
86 typedef typename M::Arc Arc;
201 typedef typename F::Arc Arc;
207 typedef typename Arc::StateId StateId
[all...] |
| rmepsilon.h | 48 template <class Arc, class Queue>
50 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
52 typedef typename Arc::StateId StateId;
53 typedef typename Arc::Weight Weight;
62 : ShortestDistanceOptions< Arc, Queue, EpsilonArcFilter<Arc> >(
63 q, EpsilonArcFilter<Arc>(), kNoStateId, d),
70 template <class Arc, class Queue>
73 typedef typename Arc::Label Label
180 Arc arc = ait.Value(); local
[all...] |
| /external/openfst/src/include/fst/extensions/far/ |
| far.h | 91 typedef A Arc;
118 typedef A Arc;
174 typedef A Arc;
204 typedef A Arc;
234 typedef A Arc;
299 typedef A Arc;
347 typedef A Arc;
394 typedef A Arc;
|
| /external/openfst/src/include/fst/script/ |
| info-impl.h | 46 typedef A Arc;
100 const A &arc = aiter.Value(); local
102 if (arc.ilabel == 0 && arc.olabel == 0)
104 if (arc.ilabel == 0)
106 if (arc.olabel == 0)
113 CcVisitor<Arc> cc_visitor(&cc);
118 Visit(fst, &cc_visitor, &fifo_queue, EpsilonArcFilter<Arc>());
120 Visit(fst, &cc_visitor, &fifo_queue, InputEpsilonArcFilter<Arc>());
122 Visit(fst, &cc_visitor, &fifo_queue, OutputEpsilonArcFilter<Arc>());
[all...] |
