| /external/openfst/src/include/fst/ |
| D | shortest-distance.h | 82 : 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 …]
|
| D | rmepsilon.h | 80 : 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
|
| D | shortest-path.h | 217 : 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
|
| D | queue.h | 811 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/ |
| D | histogram.c | 145 ++histo->distance_[code]; in VP8LHistogramAddSinglePixOrCopy()
271 + PopulationCost(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBits()
273 + VP8LExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBits()
282 + BitsEntropy(p->distance_, NUM_DISTANCE_CODES) in VP8LHistogramEstimateBitsBulk()
284 + VP8LExtraCost(p->distance_, NUM_DISTANCE_CODES); in VP8LHistogramEstimateBitsBulk()
312 *cost += GetCombinedEntropy(a->distance_, b->distance_, NUM_DISTANCE_CODES); in GetCombinedHistogramEntropy()
313 *cost += VP8LExtraCostCombined(a->distance_, b->distance_, in GetCombinedHistogramEntropy()
391 PopulationCost(h->distance_, NUM_DISTANCE_CODES) + in UpdateHistogramCost()
392 VP8LExtraCost(h->distance_, NUM_DISTANCE_CODES); in UpdateHistogramCost()
|
| D | histogram.h | 40 uint32_t distance_[NUM_DISTANCE_CODES]; member
|
| D | backward_references.c | 460 double distance_[NUM_DISTANCE_CODES]; member
526 NUM_DISTANCE_CODES, histo->distance_, m->distance_); in CostModelBuild()
557 return m->distance_[code] + extra_bits; in GetDistanceCost()
|
| D | vp8l.c | 245 VP8LCreateHuffmanTree(histo->distance_, 15, buf_rle, huff_tree, codes + 4); in GetHuffBitLengthsAndCodes()
|
| /external/webp/src/dsp/ |
| D | lossless_mips32.c | 375 ADD_VECTOR(a->distance_, b->distance_, out->distance_, in HistogramAdd()
383 ADD_VECTOR_EQ(a->distance_, out->distance_, NUM_DISTANCE_CODES, 0); in HistogramAdd()
|
| D | lossless.c | 1541 out->distance_[i] = a->distance_[i] + b->distance_[i]; in HistogramAdd()
1553 out->distance_[i] += a->distance_[i]; in HistogramAdd()
|
| D | lossless_sse2.c | 498 out->distance_[i] = a->distance_[i] + b->distance_[i]; in HistogramAdd()
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| D | expand.h | 359 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 …]
|