Home
last modified time | relevance | path

Searched refs:distance_ (Results 1 – 18 of 18) sorted by relevance

/external/srec/tools/thirdparty/OpenFst/fst/lib/
Dshortest-distance.h65 : fst_(fst.Copy()), distance_(distance), state_queue_(opts.state_queue), in ShortestDistanceState()
68 distance_->clear(); in ShortestDistanceState()
79 vector<Weight> *distance_; variable
106 distance_->clear(); in ShortestDistance()
114 while ((StateId)distance_->size() <= source) { in ShortestDistance()
115 distance_->push_back(Weight::Zero()); in ShortestDistance()
124 (*distance_)[source] = Weight::One(); in ShortestDistance()
133 while ((StateId)distance_->size() <= s) { in ShortestDistance()
134 distance_->push_back(Weight::Zero()); in ShortestDistance()
147 while ((StateId)distance_->size() <= arc.nextstate) { in ShortestDistance()
[all …]
Drmepsilon.h65 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true) { in RmEpsilonState()
117 vector<Weight> *distance_; variable
155 arc.weight = Times((*distance_)[state], arc.weight); in Expand()
182 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state))); in Expand()
336 &distance_, in RmEpsilonFstImpl()
400 vector<Weight> distance_; variable
Dshortest-path.h176 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {} in ShortestPathCompare()
181 Weight wx = Times(distance_[px.first], px.second); in operator()
182 Weight wy = Times(distance_[py.first], py.second); in operator()
197 const vector<Weight> &distance_; variable
/external/openfst/src/include/fst/
Dshortest-distance.h82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue), in ShortestDistanceState()
86 distance_->clear(); in ShortestDistanceState()
97 vector<Weight> *distance_; variable
141 distance_->clear(); in ShortestDistance()
149 while (distance_->size() <= source) { in ShortestDistance()
150 distance_->push_back(Weight::Zero()); in ShortestDistance()
159 (*distance_)[source] = Weight::One(); in ShortestDistance()
168 while (distance_->size() <= s) { in ShortestDistance()
169 distance_->push_back(Weight::Zero()); in ShortestDistance()
184 while (distance_->size() <= arc.nextstate) { in ShortestDistance()
[all …]
Drmepsilon.h80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true), in RmEpsilonState()
134 vector<Weight> *distance_; variable
181 arc.weight = Times((*distance_)[state], arc.weight); in Expand()
208 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state))); in Expand()
405 &distance_, in RmEpsilonFstImpl()
420 &distance_, in RmEpsilonFstImpl()
494 vector<Weight> distance_; variable
Dshortest-path.h217 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {} in ShortestPathCompare()
223 px.first < distance_.size() ? distance_[px.first] : Weight::Zero(); in operator()
225 py.first < distance_.size() ? distance_[py.first] : Weight::Zero(); in operator()
242 const vector<Weight> &distance_; variable
Dqueue.h811 distance_(distance), in PruneQueue()
825 if (less_(distance_[s], class_distance_[c])) in Enqueue()
826 class_distance_[c] = distance_[s]; in Enqueue()
830 if (less_(distance_[s], limit)) in Enqueue()
838 if (less_(distance_[s], class_distance_[c])) in Update()
839 class_distance_[c] = distance_[s]; in Update()
857 const vector<Weight> &distance_; // shortest distance to state variable
/external/webp/src/enc/
Dhistogram.c29 memset(p->distance_, 0, sizeof(p->distance_)); in HistogramClear()
99 ++histo->distance_[code]; in VP8LHistogramAddSinglePixOrCopy()
208 + PopulationCost(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBits()
210 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBits()
218 + BitsEntropy(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBitsBulk()
220 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBitsBulk()
234 out->distance_[i] += in->distance_[i]; in HistogramAdd()
280 out->distance_[i] = a->distance_[i] + b->distance_[i]; in HistogramAddEval()
282 cost += PopulationCost(out->distance_, NUM_DISTANCE_CODES); in HistogramAddEval()
283 cost += ExtraCost(out->distance_, NUM_DISTANCE_CODES); in HistogramAddEval()
[all …]
Dhistogram.h40 int distance_[NUM_DISTANCE_CODES]; member
Dbackward_references.c381 double distance_[NUM_DISTANCE_CODES]; member
440 NUM_DISTANCE_CODES, histo.distance_, m->distance_); in CostModelBuild()
471 return m->distance_[code] + extra_bits_count; in GetDistanceCost()
Dvp8l.c233 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4); in GetHuffBitLengthsAndCodes()
/external/chromium_org/third_party/libwebp/enc/
Dhistogram.c29 memset(p->distance_, 0, sizeof(p->distance_)); in HistogramClear()
99 ++histo->distance_[code]; in VP8LHistogramAddSinglePixOrCopy()
208 + PopulationCost(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBits()
210 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBits()
218 + BitsEntropy(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBitsBulk()
220 + ExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBitsBulk()
234 out->distance_[i] += in->distance_[i]; in HistogramAdd()
280 out->distance_[i] = a->distance_[i] + b->distance_[i]; in HistogramAddEval()
282 cost += PopulationCost(out->distance_, NUM_DISTANCE_CODES); in HistogramAddEval()
283 cost += ExtraCost(out->distance_, NUM_DISTANCE_CODES); in HistogramAddEval()
[all …]
Dhistogram.h40 int distance_[NUM_DISTANCE_CODES]; member
Dbackward_references.c381 double distance_[NUM_DISTANCE_CODES]; member
440 NUM_DISTANCE_CODES, histo.distance_, m->distance_); in CostModelBuild()
471 return m->distance_[code] + extra_bits_count; in GetDistanceCost()
Dvp8l.c233 ok = ok && VP8LCreateHuffmanTree(histo->distance_, 15, codes + 4); in GetHuffBitLengthsAndCodes()
/external/chromium_org/tools/telemetry/telemetry/page/actions/
Dswipe.js14 this.distance_ = opt_options.distance;
20 this.distance_ = 0;
57 this.options_.distance_,
/external/openfst/src/include/fst/extensions/pdt/
Dexpand.h359 queue_(state_table_, stack_, stack_length_, distance_, fdistance_) {
397 distance_(d), fdistance_(fd) {} in StackCompare()
408 Weight w1 = (s1 < distance_.size()) && (s1 < fdistance_.size()) ? in operator()
409 Times(distance_[s1], fdistance_[s1]) : Weight::Zero(); in operator()
410 Weight w2 = (s2 < distance_.size()) && (s2 < fdistance_.size()) ? in operator()
411 Times(distance_[s2], fdistance_[s2]) : Weight::Zero(); in operator()
426 const vector<Weight> &distance_; variable
471 vector<Weight> distance_; // Distance from initial state in efst_/ofst variable
573 return s < distance_.size() ? distance_[s] : Weight::Zero(); in Distance()
579 while (distance_.size() <= s ) distance_.push_back(Weight::Zero()); in SetDistance()
[all …]
/external/chromium/chrome/browser/resources/ntp/
Ddrag_drop_controller.js73 distance_: function(p1, p2) { method in DragAndDropController
125 if (this.distance_(this.startMouseXY_, this.mouseXY_) >= DRAG_THRESHOLD)