Searched defs:arc (Results 1 - 25 of 124) sorted by relevance

12345

/external/openfst/src/include/fst/
H A Dreweight.h39 // An arc of weight w, with an origin state of potential p and
78 Arc arc = ait.Value(); local
79 if (arc.nextstate >= potential.size())
81 typename Arc::Weight nextweight = potential[arc.nextstate];
85 arc.weight = Divide(Times(arc.weight, nextweight), weight,
88 arc.weight = Divide(Times(weight, arc.weight), nextweight,
90 ait.SetValue(arc);
114 Arc arc local
[all...]
H A Drmfinalepsilon.h57 const A& arc = aiter.Value(); local
58 if (coaccess[arc.nextstate]) {
77 const A& arc = aiter.Value(); local
79 if (finals.find(arc.nextstate) != finals.end()) {
81 if (arc.ilabel == 0 && arc.olabel == 0) {
82 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w);
84 arcs.push_back(arc);
87 arcs.push_back(arc);
[all...]
H A Dstatesort.h85 Arc arc = (*arcs1)[i]; local
86 arc.nextstate = order[arc.nextstate];
87 fst->AddArc(s2, arc);
H A Dverify.h64 const Arc &arc =aiter.Value(); local
65 if (!allow_negative_labels && arc.ilabel < 0) {
66 LOG(ERROR) << "Verify: Fst input label ID of arc at position "
69 } else if (isyms && isyms->Find(arc.ilabel) == "") {
70 LOG(ERROR) << "Verify: Fst input label ID " << arc.ilabel
71 << " of arc at position " << na << " of state " << s
75 } else if (!allow_negative_labels && arc.olabel < 0) {
76 LOG(ERROR) << "Verify: Fst output label ID of arc at position "
79 } else if (osyms && osyms->Find(arc.olabel) == "") {
80 LOG(ERROR) << "Verify: Fst output label ID " << arc
[all...]
H A Ddfs-visit.h54 // // Invoked when tree arc examined (to white/undiscovered state)
56 // // Invoked when back arc examined (to grey/unfinished state)
58 // // Invoked when forward or cross arc examined (to black/finished state)
147 const Arc &arc = aiter.Value(); local
148 if (arc.nextstate >= state_color.size()) {
149 nstates = arc.nextstate + 1;
152 if (!filter(arc)) {
156 int next_color = state_color[arc.nextstate];
160 dfs = visitor->TreeArc(s, arc);
162 state_color[arc
[all...]
H A Dinvert.h24 #include <fst/arc-map.h>
30 // Mapper to implement inversion of an arc.
34 A operator()(const A &arc) { argument
35 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate);
74 // time and to visit an input state or arc is assumed and exclusive
H A Dproject.h24 #include <fst/arc-map.h>
34 // Mapper to implement projection per arc.
40 A operator()(const A &arc) { argument
42 ? arc.ilabel : arc.olabel;
43 return A(label, label, arc.weight, arc.nextstate);
86 // Projects an FST onto its domain or range by either copying each arc's
94 // time and to visit an input state or arc is assumed and exclusive
H A Dpush.h29 #include <fst/arc-map.h>
79 Arc arc = ait.Value(); local
80 arc.weight = Divide(arc.weight, w, DIVIDE_LEFT);
81 ait.SetValue(arc);
H A Dtopsort.h56 bool TreeArc(StateId s, const A &arc) { return true; } argument
58 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } argument
60 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } argument
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dreweight.h34 // An arc of weight w, with an origin state of potential p and
65 Arc arc = ait.Value(); local
67 (potential[arc.nextstate] == Weight::Zero()))
71 arc.weight = Divide(Times(arc.weight, potential[arc.nextstate]),
74 && (potential[arc.nextstate] != Weight::Zero()))
75 arc.weight = Divide(Times(potential[state], arc.weight),
76 potential[arc
94 Arc arc = ait.Value(); local
[all...]
H A Drmfinalepsilon.h51 const A& arc = aiter.Value(); local
52 if (coaccess[arc.nextstate]) {
71 const A& arc = aiter.Value(); local
73 if (finals.find(arc.nextstate) != finals.end()) {
75 if (arc.ilabel == 0 && arc.olabel == 0) {
76 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w);
78 arcs.push_back(arc);
81 arcs.push_back(arc);
[all...]
H A Dstatesort.h76 Arc arc = (*arcs1)[i]; local
77 arc.nextstate = order[arc.nextstate];
78 fst->AddArc(s2, arc);
H A Dverify.h61 const Arc &arc =aiter.Value(); local
62 if (arc.ilabel < 0) {
63 LOG(ERROR) << "Verify: Fst input label ID of arc at position "
66 } else if (isyms && isyms->Find(arc.ilabel) == "") {
67 LOG(ERROR) << "Verify: Fst input label ID " << arc.ilabel
68 << " of arc at position " << na << " of state " << s
72 } else if (arc.olabel < 0) {
73 LOG(ERROR) << "Verify: Fst output label ID of arc at position "
76 } else if (osyms && osyms->Find(arc.olabel) == "") {
77 LOG(ERROR) << "Verify: Fst output label ID " << arc
[all...]
H A Dinvert.h27 // Mapper to implement inversion of an arc.
31 A operator()(const A &arc) { argument
32 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate);
59 // time and to visit an input state or arc is assumed and exclusive
H A Darc.h0 // arc.h
17 // Commonly used Fst arc types.
119 GallicArc(const A &arc) argument
120 : ilabel(arc.ilabel), olabel(arc.ilabel),
121 weight(arc.olabel, arc.weight), nextstate(arc.nextstate) {}
H A Dconcat.h62 Arc arc = aiter.Value(); local
63 arc.nextstate += numstates1;
64 fst1->AddArc(s1, arc);
102 // ith FST. Constant time and space to visit an input state or arc is
H A Ddfs-visit.h44 // // Invoked when tree arc examined (to white/undiscovered state)
46 // // Invoked when back arc examined (to grey/unfinished state)
48 // // Invoked when forward or cross arc examined (to black/finished state)
123 const Arc &arc = aiter.Value(); local
124 if (!filter(arc)) {
128 int next_color = state_color[arc.nextstate];
132 dfs = visitor->TreeArc(s, arc);
134 state_color[arc.nextstate] = kDfsGrey;
135 state_stack.push(new DfsState<Arc>(fst, arc.nextstate));
136 dfs = visitor->InitState(arc
[all...]
H A Dproject.h31 // Mapper to implement projection per arc.
37 A operator()(const A &arc) { argument
39 ? arc.ilabel : arc.olabel;
40 return A(label, label, arc.weight, arc.nextstate);
68 // Projects an FST onto its domain or range by either copying each arc's
76 // time and to visit an input state or arc is assumed and exclusive
H A Dprune.h100 Arc arc = it.Value(); local
101 if (!opts.filter(arc)) continue;
102 Weight weight = Times(Times((*idistance)[state], arc.weight),
103 (*fdistance)[arc.nextstate]);
105 arc.nextstate = dead[0];
106 it.SetValue(arc);
199 Arc arc = ait.Value(); local
201 if (!opts.filter(arc)) continue;
203 while (idistance->size() <= arc.nextstate)
205 while (fdistance->size() <= arc
[all...]
H A Dtopsort.h51 bool TreeArc(StateId s, const A &arc) { return true; } argument
53 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } argument
55 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } argument
H A Dunion.h60 Arc arc = aiter.Value(); local
61 arc.nextstate += numstates1;
62 fst1->AddArc(s1, arc);
104 // ith FST. Constant time and space to visit an input state or arc
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/vega/
H A Darc.h37 struct arc { struct
55 void arc_init(struct arc *arc,
62 void arc_add_to_polygon(struct arc *arc,
67 void arc_to_path(struct arc *arc,
71 void arc_stroke_cb(struct arc *arc,
75 void arc_stroker_emit(struct arc *ar
[all...]
/external/mesa3d/src/gallium/state_trackers/vega/
H A Darc.h37 struct arc { struct
55 void arc_init(struct arc *arc,
62 void arc_add_to_polygon(struct arc *arc,
67 void arc_to_path(struct arc *arc,
71 void arc_stroke_cb(struct arc *arc,
75 void arc_stroker_emit(struct arc *ar
[all...]
/external/srec/srec/crec/
H A Dsrec_debug.c97 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);
/external/chromium_org/third_party/WebKit/Source/core/html/canvas/
H A DCanvasPathMethods.cpp133 void CanvasPathMethods::arc(float x, float y, float r, float sa, float ea, bool anticlockwise, ExceptionState& es) function in class:WebCore::CanvasPathMethods
144 // The arc is empty but we still need to draw the connecting line.

Completed in 313 milliseconds

12345