Searched refs:arc (Results 1 - 25 of 172) sorted by relevance

1234567

/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Darcfilter.h28 bool operator()(const A &arc) const { return true; }
36 bool operator()(const A &arc) const {
37 return arc.ilabel == 0 && arc.olabel == 0;
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 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 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 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 Dtest-properties.h136 const Arc &arc =aiter.Value(); local
138 if (ilabels && ilabels->find(arc.ilabel) != ilabels->end()) {
142 if (olabels && olabels->find(arc.olabel) != olabels->end()) {
146 if (arc.ilabel != arc.olabel) {
150 if (arc.ilabel == 0 && arc.olabel == 0) {
154 if (arc.ilabel == 0) {
158 if (arc.olabel == 0) {
162 if (prev_arc.ilabel != kNoLabel && arc
[all...]
H A Dshortest-distance.h144 const Arc &arc = aiter.Value(); local
145 if (!arc_filter_(arc) || arc.weight == Weight::Zero())
147 while ((StateId)distance_->size() <= arc.nextstate) {
153 while ((StateId)sources_.size() <= arc.nextstate)
155 if (sources_[arc.nextstate] != source) {
156 (*distance_)[arc.nextstate] = Weight::Zero();
157 rdistance_[arc.nextstate] = Weight::Zero();
158 enqueued_[arc.nextstate] = false;
159 sources_[arc
[all...]
H A Dmap.h35 // A final weight is mapped to an arc to the superfinal state
40 // A final weight is mapped to an arc to the superfinal state
52 // // Maps an arc type A to arc type B.
53 // B operator()(const A &arc);
78 // Maps an arc type A using a mapper function object C, passed
100 const A &arc = aiter.Value(); local
101 aiter.SetValue((*mapper)(arc));
146 // Maps an arc type A using a mapper function object C, passed
154 // Maps an arc typ
780 operator ()(const FromArc &arc) argument
[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
/external/srec/tools/grxmlcompile/
H A Dsub_min.cpp28 #define SYMBOL_COMPARE(x,y) (arc[x]->CompareSymbol(arc[y]))
29 #define COMPARE(x,y) (arc[x]->Compare(arc[y]))
55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
56 arc[forwardList[rix]]->Print();
77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId
78 && arc[forwardList[fix]]->GetToId() == DISCARD_LABEL)
80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId)
81 fnxt= arc[forwardLis
[all...]
H A Dnetw_dump.cpp37 origIndex= arc[ii]->GetInput();
39 arc[ii]->AssignInput (sortedIndex);
61 switch ( arc[loc]->inputLabel ) {
63 outfile << arc[loc]->fromId << std::endl;
66 outfile << arc[loc]->fromId << separator << arc[loc]->toId << separator << Eps << std::endl;
78 // if (!p_Doc.findLabel( arc[loc]->inputLabel, inLabel ) ) {
79 if (!p_Doc.findSortedLabel( arc[loc]->inputLabel, inLabel ) ) {
81 ss << arc[loc]->inputLabel;
84 outfile << arc[lo
[all...]
H A Dsub_base.cpp35 arc= new NUANArc * [BLKSIZE];
60 arc= new NUANArc * [BLKSIZE];
65 new_arc[ii]= arc[ii];
66 delete [] arc;
67 arc= new_arc;
76 arc[numArc]= arc_one;
86 arc[numArc]= arc_one;
96 arc[numArc]= arc_one;
107 arc[numArc]= arc_one;
117 arc[numAr
[all...]
H A Dsub_phon.cpp54 wordId= arc[ii]->GetInput();
60 arcOne= CreateArc (NONE_LABEL, NONE_LABEL, arc[ii]->GetFromId(), newId);
66 // (void) CreateArc (-wordId, NONE_LABEL, arc[ii]->GetFromId(), newId);
67 arcOne= CreateArc (WB_LABEL, NONE_LABEL, nextId, arc[ii]->GetToId());
69 // (void) CreateArc (WB_LABEL, wordId, newId, arc[ii]->GetToId());
76 currId= arc[ii]->GetFromId();
90 arcOne= CreateArc (WB_LABEL, wordId, currId, arc[ii]->GetToId());
95 arc[ii]->AssignInput (DISCARD_LABEL); // Delete original arc
101 arc[i
[all...]
H A Dfst-io.h27 // on the arc type to support multiple and extensible arc types.
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);
122 if (arc.weight != Weight::One())
123 *ostrm_ << "\t" << arc
239 Arc arc; local
[all...]
/external/openfst/src/include/fst/
H A Darcfilter.h35 bool operator()(const A &arc) const { return true; }
43 bool operator()(const A &arc) const {
44 return arc.ilabel == 0 && arc.olabel == 0;
53 bool operator()(const A &arc) const {
54 return arc.ilabel == 0;
63 bool operator()(const A &arc) const {
64 return arc.olabel == 0;
81 bool operator()(const A &arc) const {
82 Label label = match_input_ ? arc
[all...]
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 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 Dprune.h156 Arc arc = ait.Value(); local
157 if (!opts.filter(arc)) continue;
158 Weight weight = Times(Times(idistance[s], arc.weight),
159 arc.nextstate < fdistance->size()
160 ? (*fdistance)[arc.nextstate]
163 arc.nextstate = dead[0];
164 ait.SetValue(arc);
167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate]))
168 idistance[arc
282 const Arc &arc = ait.Value(); 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 Dvisit.h50 // // Invoked when arc to white/undiscovered state examined
52 // // Invoked when arc to grey/unfinished state examined
54 // // Invoked when arc to black/finished state examined
119 // Creates arc iterator if needed.
122 // Deletes arc iterator if done.
137 const Arc &arc = aiter->Value(); local
138 if (arc.nextstate >= state_status.size()) {
139 nstates = arc.nextstate + 1;
143 // Visits respective arc types
144 if (filter(arc)) {
213 WhiteArc(StateId s, const Arc &arc) argument
218 GreyArc(StateId s, const Arc &arc) argument
223 BlackArc(StateId s, const Arc &arc) argument
256 WhiteArc(StateId s, const Arc &arc) argument
257 GreyArc(StateId s, const Arc &arc) argument
258 BlackArc(StateId s, const Arc &arc) argument
[all...]
H A Dtest-properties.h138 const Arc &arc =aiter.Value(); local
140 if (ilabels && ilabels->find(arc.ilabel) != ilabels->end()) {
144 if (olabels && olabels->find(arc.olabel) != olabels->end()) {
148 if (arc.ilabel != arc.olabel) {
152 if (arc.ilabel == 0 && arc.olabel == 0) {
156 if (arc.ilabel == 0) {
160 if (arc.olabel == 0) {
164 if (prev_arc.ilabel != kNoLabel && 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 Darc-map.h0 // arc-map.h
45 // A final weight is mapped to an arc to the superfinal state
50 // A final weight is mapped to an arc to the superfinal state
79 // // Maps an arc type A to arc type B.
80 // B operator()(const A &arc);
109 // Maps an arc type A using a mapper function object C, passed
137 const A &arc = aiter.Value(); local
138 aiter.SetValue((*mapper)(arc));
146 FSTERROR() << "ArcMap: non-zero arc label
891 operator ()(const FromArc &arc) argument
[all...]
/external/openfst/src/include/fst/script/
H A Dcompile-impl.h85 Arc arc; local
95 arc.nextstate = d = StrToStateId(col[1]);
96 arc.ilabel = StrToILabel(col[2]);
97 arc.olabel = arc.ilabel;
98 arc.weight = Weight::One();
99 fst_.AddArc(s, arc);
102 arc.nextstate = d = StrToStateId(col[1]);
103 arc.ilabel = StrToILabel(col[2]);
105 arc
[all...]
/external/oprofile/libop/
H A Dop_alloc_counter.c59 counter_arc * arc = local
61 arc->counter = j;
69 list_add_tail(&arc->next, &ctr_arc[i].next);
91 counter_arc * arc = list_entry(pos, counter_arc, next); local
92 list_del(&arc->next);
93 free(arc);
143 counter_arc const * arc = list_entry(pos, counter_arc, next); local
145 if (allocated_mask & (1 << arc->counter))
148 counter_map[depth] = arc->counter;
151 allocated_mask | (1 << arc
[all...]

Completed in 217 milliseconds

1234567