| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| minimize.h | 30 #include "fst/lib/factor-weight.h"
42 // - final weight
44 // - (input label, output label, weight, destination_block)
49 typedef typename A::Weight Weight;
121 typedef typename A::Weight Weight;
166 // same final weight
303 typedef typename A::Weight Weight;
[all...] |
| queue.h | 47 // // Updates ordering of state s when weight changes, if necessary
247 typedef typename L::Weight Weight;
250 StateWeightCompare(const vector<Weight>* weights, const L &less)
258 const vector<Weight>* weights_;
263 // Shortest-first queue discipline, templated on the StateId and Weight is
264 // specialized to use the weight's natural order for the comparion function.
502 // the Weight type has the path property, will entertain the
505 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance,
507 typedef typename Arc::Weight Weight
[all...] |
| rmepsilon.h | 31 #include "fst/lib/factor-weight.h"
60 typedef typename Arc::Weight Weight;
63 vector<Weight> *distance,
68 // Compute arcs and final weight for state 's'
74 // Returns final weight of expanded state.
75 const Weight &Final() const { return final_; }
117 vector<Weight> *distance_;
130 Weight final_; // Final weight of state being expande
[all...] |
| synchronize.h | 53 typedef typename A::Weight Weight;
106 Weight Final(StateId s) {
109 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state);
110 if ((w != Weight::Zero()) && (e.istring)->empty() && (e.ostring)->empty())
113 SetFinal(s, Weight::Zero());
221 Car(e.ostring, arc.olabel), arc.weight, d));
226 AddArc(s, Arc(0 , 0, arc.weight, d));
230 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state)
[all...] |
| determinize.h | 32 #include "fst/lib/factor-weight.h"
49 typedef W Weight;
62 typedef StringWeight<L, S> Weight;
64 Weight operator()(const Weight &w1, const Weight &w2) const {
69 LOG(FATAL) << "LabelCommonDivisor: Weight needs to be left semiring";
72 return Weight::One();
73 else if (w1 == Weight::Zero())
74 return Weight(iter2.Value())
219 Weight weight; \/\/ Residual weight member in struct:fst::DeterminizeFsaImpl::Element
[all...] |
| fst.h | 121 typedef typename A::Weight Weight;
128 virtual Weight Final(StateId) const = 0; // State's final weight
398 typedef typename A::Weight Weight;
|
| map.h | 31 // A final weight is mapped into a final weight. An error
35 // A final weight is mapped to an arc to the superfinal state
36 // when the result cannot be represented as a final weight.
40 // A final weight is mapped to an arc to the superfinal state
41 // unless the result can be represented as a final weight of weight
56 // // form A(0, 0, weight, kNoStateId).
83 typedef typename A::Weight Weight;
[all...] |
| replace.h | 74 typedef typename A::Weight Weight;
193 depfst.AddArc(i - 1, A(arc.olabel, arc.olabel, Weight::One(), j));
200 depfst.SetFinal(root_ - 1, Weight::One());
239 // return final weight of state (kInfWeight means state is not final)
240 Weight Final(StateId s) {
247 if (fst->Final(fst_state) != Weight::Zero() && stack.Depth() == 0)
250 SetFinal(s, Weight::Zero());
307 if (fst->Final(fst_state) != Weight::Zero() && stack.Depth()) {
323 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate))
[all...] |
| vector-fst.h | 39 typedef typename Arc::Weight Weight;
51 Weight Final(StateId s) const { return states_[s]->final; }
59 void SetFinal(StateId s, Weight w) { states_[s]->final = w; }
162 typedef typename A::Weight Weight;
165 VectorState() : final(Weight::Zero()), niepsilons(0), noepsilons(0) {}
167 Weight final; // Final weight
189 typedef typename A::Weight Weight
[all...] |
| /external/llvm/include/llvm/Support/ |
| IntegersSubsetMapping.h | 43 RangeEx() : Weight(1) {}
44 RangeEx(const RangeTy &R) : RangeTy(R), Weight(1) {}
45 RangeEx(const RangeTy &R, unsigned W) : RangeTy(R), Weight(W) {}
46 RangeEx(const IntTy &C) : RangeTy(C), Weight(1) {}
47 RangeEx(const IntTy &L, const IntTy &H) : RangeTy(L, H), Weight(1) {}
49 RangeTy(L, H), Weight(W) {}
50 unsigned Weight;
320 unsigned Weight = OldItems.begin()->first.Weight;
326 Weight += j->first.Weight
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveIntervalAnalysis.cpp | 173 float Weight = TargetRegisterInfo::isPhysicalRegister(reg) ? HUGE_VALF : 0.0F;
174 return new LiveInterval(reg, Weight);
[all...] |
| MachineBasicBlock.cpp | 482 void MachineBasicBlock::addSuccessor(MachineBasicBlock *succ, uint32_t weight) {
484 // If we see non-zero value for the first time it means we actually use Weight
486 if (weight != 0 && Weights.empty())
489 if (weight != 0 || !Weights.empty())
490 Weights.push_back(weight);
501 // If Weight list is empty it means we don't use it (disabled optimization).
514 // If Weight list is empty it means we don't use it (disabled optimization).
555 // Update its weight instead of adding a duplicate edge.
580 uint32_t Weight = 0;
582 // If Weight list is empty it means we don't use it (disabled optimization)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| Reassociate.cpp | 342 /// IncorporateWeight - Add the extra weight 'RHS' to the existing weight 'LHS',
343 /// reducing the combined weight using any special properties of the operation.
344 /// The existing weight LHS represents the computation X op X op ... op X where
345 /// X occurs LHS times. The combined weight represents X op X op ... op X with
351 // weight would be LHS + RHS. But we are using finite precision arithmetic,
355 // weight back into range if wrapping would be wrong.
357 // If RHS is zero then the weight didn't change.
360 // If LHS is zero then the combined weight is RHS.
368 // Idempotent means X op X === X, so any non-zero weight is equivalent to
[all...] |
| /external/openfst/src/include/fst/ |
| accumulator.h | 19 // Classes to accumulate arc weights. Useful for weight lookahead.
46 typedef typename A::Weight Weight;
56 Weight Sum(Weight w, Weight v) {
61 Weight Sum(Weight w, ArcIterator *aiter, ssize_t begin,
63 Weight sum = w;
66 sum = Plus(sum, aiter->Value().weight);
[all...] |
| compose.h | 119 typedef typename A::Weight Weight;
160 Weight Final(StateId s) {
162 Weight final = ComputeFinal(s);
196 virtual Weight ComputeFinal(StateId s) = 0;
210 typedef typename Arc::Weight Weight;
299 Weight::One(), sb);
334 Arc oarc(arc1.ilabel, arc2.olabel, Times(arc1.weight, arc2.weight),
[all...] |
| edit-fst.h | 72 typedef typename A::Weight Weight;
76 typedef typename unordered_map<StateId, Weight>::const_iterator
125 Weight Final(StateId s, const WrappedFstT *wrapped) const {
169 Weight SetFinal(StateId s, Weight w, const WrappedFstT *wrapped) {
170 Weight old_weight = Final(s, wrapped);
300 // copy the final weight
322 // those states. The states in this map are *only* those whose final weight
325 unordered_map<StateId, Weight> edited_final_weights_
[all...] |
| lookahead-matcher.h | 47 // typedef typename Arc::Weight Weight;
74 // // Gives an estimate of the combined weight of the paths P in the
76 // // A trivial implementation returns Weight::One(). Non-trivial
77 // // implementations are useful for weight-pushing in composition.
78 // Weight LookAheadWeight() const;
138 typedef typename A::Weight Weight;
141 : weight_(Weight::One()),
142 prefix_arc_(kNoLabel, kNoLabel, Weight::One(), kNoStateId) {
[all...] |
| matcher.h | 46 // typedef typename Arc::Weight Weight;
109 typedef typename A::Weight Weight;
134 // Arc(kNoLabel, 0, Weight::One(), current_state) as well as any
136 // Arc(0, kNoLabel, Weight::One(), current_state) is instead matched.
144 typedef typename Arc::Weight Weight;
157 loop_(kNoLabel, 0, Weight::One(), kNoStateId),
401 typedef typename Arc::Weight Weight
[all...] |
| queue.h | 51 // // Updates ordering of state s when weight changes, if necessary
279 typedef typename L::Weight Weight;
282 StateWeightCompare(const vector<Weight>& weights, const L &less)
290 const vector<Weight>& weights_;
295 // Shortest-first queue discipline, templated on the StateId and Weight, is
296 // specialized to use the weight's natural order for the comparison function.
540 // the Weight type has the path property, will entertain the
543 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance,
545 typedef typename Arc::Weight Weight
[all...] |
| randgen.h | 40 // transition is selected. If N == NumArcs(), then the final weight at
50 typedef typename A::Weight Weight;
57 if (fst.Final(s) != Weight::Zero())
65 // log probabilities after normalizing for the total weight leaving
66 // the state. Weight::zero transitions are disregarded.
67 // Assumes Weight::Value() accesses the floating point
68 // representation of the weight.
73 typedef typename A::Weight Weight;
463 Weight weight = weighted_ ? to_weight_(-log(prob)) : Weight::One(); local
472 Weight weight = remove_total_weight_ ? local
[all...] |
| vector-fst.h | 45 typedef typename Arc::Weight Weight;
57 Weight Final(StateId s) const { return states_[s]->final; }
65 void SetFinal(StateId s, Weight w) { states_[s]->final = w; }
168 typedef typename A::Weight Weight;
171 VectorState() : final(Weight::Zero()), niepsilons(0), noepsilons(0) {}
173 Weight final; // Final weight
198 typedef typename A::Weight Weight
[all...] |
| arc-map.h | 41 // A final weight is mapped into a final weight. An error
45 // A final weight is mapped to an arc to the superfinal state
46 // when the result cannot be represented as a final weight.
50 // A final weight is mapped to an arc to the superfinal state
51 // unless the result can be represented as a final weight of weight
83 // // form A(0, 0, weight, kNoStateId).
114 typedef typename A::Weight Weight;
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| compose.h | 48 typedef typename Arc::Weight Weight;
62 loop_.weight = Weight::One();
284 typedef typename Arc::Weight Weight;
377 void FilterFinal(Weight *w1, Weight *w2) const {
379 *w1 = Weight::Zero();
|
| /external/chromium_org/courgette/ |
| adjustment_method.cc | 152 uint32 Weight() const {
193 uint32 a_weight = a->Weight();
194 uint32 b_weight = b->Weight();
|
| /external/llvm/utils/TableGen/ |
| CodeGenRegisters.h | 408 // Weight assigned to this RegUnit for estimating register pressure.
411 unsigned Weight;
422 RegUnit() : Weight(0), RegClassUnitSetsIdx(0) { Roots[0] = Roots[1] = 0; }
436 unsigned Weight; // Cache the sum of all unit weights.
439 RegUnitSet() : Weight(0), Order(0) {}
512 // Compute a weight for each register unit created during getSubRegs.
589 unsigned newRegUnit(unsigned Weight) {
591 RegUnits.back().Weight = Weight;
597 // register additional weight but don't affect aliasing
[all...] |
