| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| topsort.h | 35 typedef A Arc;
51 bool TreeArc(StateId s, const A &arc) { return true; }
53 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); }
55 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; }
85 template <class Arc>
86 bool TopSort(MutableFst<Arc> *fst) {
87 typedef typename Arc::StateId StateId;
92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
|
| shortest-path.h | 32 template <class Arc, class Queue, class ArcFilter>
34 : public ShortestDistanceOptions<Arc, Queue, ArcFilter> {
35 typedef typename Arc::StateId StateId;
44 : ShortestDistanceOptions<Arc, Queue, ArcFilter>(q, filt, kNoStateId, d),
53 // such as the queue discipline, the arc filter and delta.
60 template<class Arc, class Queue, class ArcFilter>
61 void SingleShortestPath(const Fst<Arc> &ifst,
62 MutableFst<Arc> *ofst,
63 vector<typename Arc::Weight> *distance,
64 ShortestPathOptions<Arc, Queue, ArcFilter> &opts)
115 const Arc &arc = aiter.Value(); local
[all...] |
| equivalent.h | 38 // disjoint, we map Arc::StateId on the type MappedId. The states of
45 template <class Arc>
47 typedef typename Arc::StateId StateId;
48 typedef typename Arc::Weight Weight;
74 static bool IsFinal(const Fst<Arc> &fa, MappedId s) {
112 template <class Arc>
113 bool Equivalent(const Fst<Arc> &fst1, const Fst<Arc> &fst2) {
114 typedef typename Arc::Weight Weight;
128 VectorFst<Arc> efst1(fst1)
193 const Arc &arc = arc_iter.Value(); local
205 const Arc &arc = arc_iter.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...] |
| replace.h | 32 // By default ReplaceFst will copy the input label of the 'replace arc'.
34 // create an epsilon arc when recursing into the appropriate Fst.
77 typedef A Arc;
180 // an arc from each state (representing the fst) to the
187 const A& arc = aiter.Value(); local
190 nonterminal_hash_.find(arc.olabel);
193 depfst.AddArc(i - 1, A(arc.olabel, arc.olabel, Weight::One(), j));
273 // return the base arc iterator, if arcs have not been computed yet,
319 const Arc& arc = aiter.Value() local
[all...] |
| relabel.h | 67 A arc = aiter.Value(); local
72 input_map.find(arc.ilabel);
73 if (it != input_map.end()) {arc.ilabel = it->second; }
76 it = output_map.find(arc.olabel);
77 if (it != output_map.end()) { arc.olabel = it->second; }
79 aiter.SetValue(arc);
276 A arc = aiter.Value(); local
281 input_map_.find(arc.ilabel);
282 if (it != input_map_.end()) { arc.ilabel = it->second; }
288 output_map_.find(arc.olabel)
[all...] |
| randgen.h | 31 // ARC SELECTORS - these function objects are used to select a random
74 const A &arc = aiter.Value(); local
75 sum += exp(-arc.weight.Value());
84 const A &arc = aiter.Value(); local
85 p += exp(-arc.weight.Value());
100 const S &arc_selector; // How an arc is selected at a state
116 template<class Arc, class ArcSelector>
117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
119 typedef typename Arc::Weight Weight
[all...] |
| connect.h | 33 typedef A Arc;
34 typedef typename Arc::Weight Weight;
102 bool TreeArc(StateId s, const A &arc) { return true; }
104 bool BackArc(StateId s, const A &arc) {
105 StateId t = arc.nextstate;
112 if (arc.nextstate == start_) {
119 bool ForwardOrCrossArc(StateId s, const A &arc) {
120 StateId t = arc.nextstate;
201 template<class Arc>
202 void Connect(MutableFst<Arc> *fst)
[all...] |
| determinize.h | 203 // It is templated on the arc type A and the common divisor C.
314 const A &arc = aiter.Value(); local
315 Element dest_element(arc.nextstate,
316 Times(src_element.weight, arc.weight));
317 Subset* &dest_subset = (*label_map)[arc.ilabel];
325 // Adds an arc from state S to the destination state associated
328 A arc; local
329 arc.ilabel = label;
330 arc.olabel = label;
331 arc.weight = Weight::Zero()
[all...] |
| rmepsilon.h | 40 template <class Arc, class Queue>
42 : public ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> > {
43 typedef typename Arc::StateId StateId;
48 : ShortestDistanceOptions<Arc, Queue, EpsilonArcFilter<Arc> >(
49 q, EpsilonArcFilter<Arc>(), kNoStateId, d), connect(c) {}
55 template <class Arc, class Queue>
58 typedef typename Arc::Label Label;
59 typedef typename Arc::StateId StateId
154 Arc arc = ait.Value(); local
[all...] |
| concat.h | 38 template<class Arc>
39 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {
40 typedef typename Arc::StateId StateId;
41 typedef typename Arc::Label Label;
42 typedef typename Arc::Weight Weight;
53 for (StateIterator< Fst<Arc> > siter2(fst2);
59 for (ArcIterator< Fst<Arc> > aiter(fst2, s2);
62 Arc arc = aiter.Value() local
[all...] |
| minimize.h | 79 // # arcs are equal, check for arc match
213 // allocate arc iterator queue
220 // Prep priority queue. Open arc iterator for each state in C, and
229 // Now pop arc iterator from queue, split entering equivalence class
240 const RevA& arc = aiter->Value(); local
242 Label from_label = arc.ilabel;
283 // Priority queue of open arc iterators for all states in the 'splitter'
334 // invoked when tree arc examined (to undiscoverted state)
335 bool TreeArc(StateId s, const A& arc) {
339 // invoked when back arc examined (to unfinished state
458 A arc = aiter.Value(); local
[all...] |
| union.h | 36 template <class Arc>
37 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) {
38 typedef typename Arc::StateId StateId;
39 typedef typename Arc::Label Label;
40 typedef typename Arc::Weight Weight;
51 for (StateIterator< Fst<Arc> > siter(fst2);
57 for (ArcIterator< Fst<Arc> > aiter(fst2, s2);
60 Arc arc = aiter.Value() local
[all...] |
| factor-weight.h | 147 typedef A Arc;
261 const A &arc = ait.Value(); local
262 Weight w = Times(e.weight, arc.weight);
265 StateId d = FindState(Element(arc.nextstate, Weight::One()));
266 AddArc(s, Arc(arc.ilabel, arc.olabel, w, d));
270 StateId d = FindState(Element(arc.nextstate,
272 AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d))
[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...] |
| mutable-fst.h | 18 // and mutable arc iterator interface.
35 typedef A Arc;
46 virtual void AddArc(StateId, const A &arc) = 0; // Add an arc to state
90 << "\" (arc type = \"" << A::Type()
108 // For generic mutuble arc iterator construction; not normally called
114 // Mutable arc iterator interface, templated on the Arc definition.
118 typedef A Arc;
119 virtual void SetValue(const A &arc) = 0; // Set current arc's content
[all...] |
| /external/freetype/src/smooth/ |
| ftgrays.c | 877 FT_Vector* arc; local
880 arc = ras.bez_stack;
881 arc[0].x = UPSCALE( to->x );
882 arc[0].y = UPSCALE( to->y );
883 arc[1].x = UPSCALE( control->x );
884 arc[1].y = UPSCALE( control->y );
885 arc[2].x = ras.x;
886 arc[2].y = ras.y;
888 dx = FT_ABS( arc[2].x + arc[0].x - 2 * arc[1].x )
975 FT_Vector* arc; local
[all...] |
| /external/srec/srec/crec/ |
| srec_context.c | 104 int sprintf_arc(char* buf, srec_context* fst, FSMarc* arc);
105 int printf_arc1(srec_context* fst, char* msg, FSMarc* arc);
112 int fst_push_arc_olabel(srec_context* fst, FSMarc* arc);
113 int fst_push_arc_cost(srec_context* fst, FSMarc* arc);
114 int fst_pull_arc_olabel(srec_context* fst, FSMarc* arc);
115 int fst_free_arc(srec_context* fst, FSMarc* arc);
117 int fst_free_arc_net(srec_context* fst, FSMarc* arc);
984 /* setup the arc freelist */
1253 FSMarc* arc; local
1518 FSMarc *arc = NULL, *arc2; local
1544 FSMarc *arc = NULL, *arc2; local
1577 FSMarc_t *arc, *arc2, *arc3; local
3060 FSMarc* arc; local
3612 FSMarc* arc; local
3645 FSMarc* arc; local
3762 FSMarc* arc; local
[all...] |
| srec_debug.c | 97 FSMarc* arc = &context->FSMarc_list[stoken->FSMarc_index]; local
105 printf("%sstoken %4d at arc %4d ilabel %4d nextnode %4d states", msg, token_index,
106 stoken->FSMarc_index, arc->ilabel, arc->to_node);
|
| srec_tokens.h | 36 stokenID setup_free_fsmarc_token(srec *rec, FSMarc* arc, arcID fsm_arc_index, miscdata what_to_do_if_fails);
|
| /external/dbus/test/ |
| decode-gcov.c | 405 printf (" Arc has destination block %ld flags 0x%lx\n",
465 printf ("%ld executions of arc %d\n",
497 * . 8 bytes each, a count of execution for each arc
564 die ("no arc count for function\n");
578 die ("did not get execution count for arc\n");
582 printf (" %ld executions of arc %d (total arcs %d)\n",
607 typedef struct Arc Arc;
613 struct Arc
622 Arc *pred_next
680 Arc *arc; local
1119 Arc *arc; local
[all...] |
| /external/srec/tools/test_g2g/ |
| test_g2g.c | 249 FSMarc* arc = &fst->FSMarc_list[i]; local
250 nodeID fr_node = arc->fr_node;
252 ilabels_following[0] = arc->ilabel;
255 for( ; fr_node!=fst->start_node; fr_node=arc->fr_node) {
258 for( ; iarc!=MAXarcID; iarc=arc->linkl_prev_arc) {
259 arc = &fst->FSMarc_list[iarc];
260 if(arc->fr_node != fr_node) break;
266 if(arc->ilabel == WORD_BOUNDARY) break;
267 ilabels_preceding[num_ilabels_preceding++] = arc->ilabel;
269 arc = &fst->FSMarc_list[i]
[all...] |
| /external/freetype/src/raster/ |
| ftraster.c | 333 /* States of each line, arc, and profile */
466 TPoint* arc; /* current Bezier arc pointer */ member in struct:TWorker_
479 Bool joint; /* signals that the last arc ended */
656 * given y-monotonous Bezier arc that crosses a scanline before
1258 TPoint* arc; local
1388 TPoint* arc = ras.arc; local
[all...] |
| /external/freetype/src/base/ |
| ftstroke.c | 579 /* add cubic arc */
584 /* process the rest of the arc ?? */
874 /* create a circular arc at a corner or cap */
1359 FT_Vector* arc; local
1555 FT_Vector* arc; local
[all...] |
| /external/valgrind/main/exp-bbv/tests/x86/ |
| million.S | 20 # in arc/x86/include/asm/unistd_32.h on Linux
|
