| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| rational.h | 71 rfst_.SetFinal(1, Weight::One());
75 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
76 rfst_.AddArc(0, A(0, -2, Weight::One(), 1));
94 rfst_.SetFinal(2, Weight::One());
98 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
99 rfst_.AddArc(1, A(0, -2, Weight::One(), 2));
115 rfst_.SetFinal(0, Weight::One());
116 rfst_.AddArc(0, A(0, -1, Weight::One(), 0));
121 rfst_.SetFinal(1, Weight::One());
122 rfst_.AddArc(0, A(0, -1, Weight::One(), 1))
[all...] |
| reweight.h | 87 if ((potential[fst->Start()] != Weight::One()) &&
99 Divide(Weight::One(), potential[state], DIVIDE_RIGHT),
106 fst->SetFinal(state, Times(Divide(Weight::One(), potential[state],
114 Divide(Weight::One(), potential[fst->Start()], DIVIDE_RIGHT);
|
| union.h | 73 fst1->AddArc(start1, Arc(0, 0, Weight::One(), start2 + numstates1));
77 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start1));
78 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start2 + numstates1));
|
| closure.h | 32 // transduced to itself with weight Weight::One() as well.
57 fst->SetFinal(nstart, Weight::One());
59 fst->AddArc(nstart, Arc(0, 0, Weight::One(), start));
88 // to itself with weight Weight::One() as well.
|
| shortest-path.h | 101 distance->push_back(Weight::One());
145 (*distance)[source] = Weight::One();
263 distance->insert(distance->begin(), Weight::One());
278 distance->push_back(Weight::One()); // differently when unique=true
287 ofst->SetFinal(final, Weight::One());
290 pairs[final] = Pair(rfst.Start(), Weight::One());
301 ofst->AddArc(ofst->Start(), Arc(0, 0, Weight::One(), state));
|
| factor-weight.h | 73 pair<W, W> Value() const { return make_pair(W::One(), W::One()); } // unused
120 GallicWeight<L, W, S> w2(iter.Value().second, W::One());
182 StateId start = FindState(Element(fst_->Start(), Weight::One()));
232 if (final_only_ && e.weight == Weight::One()) {
265 StateId d = FindState(Element(arc.nextstate, Weight::One()));
|
| randgen.h | 141 ofst->SetFinal(opts.dest, Weight::One());
146 Arc oarc(iarc.ilabel, iarc.olabel, Weight::One(), ofst->AddState());
|
| reverse.h | 56 ofst->SetFinal(os, RevWeight::One());
|
| product-weight.h | 44 static const ProductWeight<W1, W2> &One() {
45 static const ProductWeight<W1, W2> one(W1::One(), W2::One());
46 return one;
|
| test-properties.h | 126 Arc prev_arc(kNoLabel, kNoLabel, Weight::One(), 0);
170 if (arc.weight != Weight::One() && arc.weight != Weight::Zero()) {
197 if (final != Weight::One()) {
|
| map.h | 68 // We include a various map versions below. One dimension of
94 fst->SetFinal(superfinal, Weight::One());
119 fst->SetFinal(superfinal, Weight::One());
177 ofst->SetFinal(superfinal, B::Weight::One());
201 ofst->SetFinal(superfinal, B::Weight::One());
314 SetFinal(s, Weight::One());
326 SetFinal(s, s == superfinal_ ? Weight::One() : Weight::Zero());
693 return ToArc(0, 0, GW(SW::One(), arc.weight), kNoStateId);
700 GW(SW::One(), arc.weight), arc.nextstate);
771 fst_->SetFinal(state_, AW::One());
[all...] |
| complement.h | 78 return Weight::One();
239 arc_.weight = Weight::One();
|
| float-weight.h | 128 static const TropicalWeight One() { return TropicalWeight(0.0F); }
194 static const LogWeight One() { return LogWeight(0.0F); }
|
| shortest-distance.h | 124 (*distance_)[source] = Weight::One();
125 rdistance_[source] = Weight::One();
|
| vector-fst.h | 215 if (ow != Weight::Zero() && ow != Weight::One())
218 if (w != Weight::Zero() && w != Weight::One()) {
263 if (arc.weight != Weight::Zero() && arc.weight != Weight::One()) {
757 if (oarc.weight != Weight::Zero() && oarc.weight != Weight::One())
772 if (arc.weight != Weight::Zero() && arc.weight != Weight::One())
|
| determinize.h | 72 return Weight::One();
80 return Weight::One();
245 Element element(s, Weight::One());
|
| queue.h | 99 // at most one state at a time. It is used for strongly connected components
100 // with only one state and no self loops.
643 // Zero() or One().
670 if (!less || ((*less)(arc.weight, Weight::One())))
674 (arc.weight != Weight::Zero() && arc.weight != Weight::One()))
681 (arc.weight != Weight::Zero() && arc.weight != Weight::One()))
|
| encode.h | 115 flags_ & kEncodeWeights ? arc.weight : Weight::One());
240 flags_ & kEncodeWeights ? Weight::One() : arc.weight,
|
| synchronize.h | 109 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state);
230 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state);
|
| /external/srec/tools/grxmlcompile/ |
| fst-io.h | 122 if (arc.weight != Weight::One())
130 if (final != Weight::One()) {
243 fst_.SetFinal(s, Weight::One());
252 arc.weight = Weight::One();
263 arc.weight = Weight::One();
|
| /external/libvpx/vp8/common/arm/neon/ |
| shortidct4x4llm_neon.asm | 118 ;One word each is reserved. Label filter_coeff can be used to access the data.
|
| bilinearpredict4x4_neon.asm | 128 ;One word each is reserved. Label filter_coeff can be used to access the data.
|
| bilinearpredict8x4_neon.asm | 133 ;One word each is reserved. Label filter_coeff can be used to access the data.
|
| loopfiltersimplehorizontaledge_neon.asm | 19 ;are equal. So, in the code, only one load is needed
109 ;One word each is reserved. Label filter_coeff can be used to access the data.
|
| /external/libvpx/vp8/encoder/arm/neon/ |
| fastfdct4x4_neon.asm | 117 ;One word each is reserved. Label filter_coeff can be used to access the data.
|
