/external/chromium_org/third_party/libwebp/enc/ |
histogram.h | 40 int distance_[NUM_DISTANCE_CODES]; member in struct:__anon12119
|
backward_references.c | 381 double distance_[NUM_DISTANCE_CODES]; member in struct:__anon12114 440 NUM_DISTANCE_CODES, histo.distance_, m->distance_); 471 return m->distance_[code] + extra_bits_count;
|
/external/webp/src/enc/ |
histogram.h | 40 int distance_[NUM_DISTANCE_CODES]; member in struct:__anon28566
|
backward_references.c | 381 double distance_[NUM_DISTANCE_CODES]; member in struct:__anon28561 440 NUM_DISTANCE_CODES, histo.distance_, m->distance_); 471 return m->distance_[code] + extra_bits_count;
|
/external/openfst/src/include/fst/ |
shortest-distance.h | 82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue), 86 distance_->clear(); 97 vector<Weight> *distance_; member in class:fst::ShortestDistanceState 106 vector<StateId> sources_; // Source ID for ith state in 'distance_', 141 distance_->clear(); 149 while (distance_->size() <= source) { 150 distance_->push_back(Weight::Zero()); 159 (*distance_)[source] = Weight::One(); 168 while (distance_->size() <= s) { 169 distance_->push_back(Weight::Zero()) [all...] |
rmepsilon.h | 80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true), 134 vector<Weight> *distance_; member in class:fst::RmEpsilonState 181 arc.weight = Times((*distance_)[state], arc.weight); 208 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state))); 405 &distance_, 420 &distance_, 494 vector<Weight> distance_; member in class:fst::RmEpsilonFstImpl
|
queue.h | 811 distance_(distance), 825 if (less_(distance_[s], class_distance_[c])) 826 class_distance_[c] = distance_[s]; 830 if (less_(distance_[s], limit)) 838 if (less_(distance_[s], class_distance_[c])) 839 class_distance_[c] = distance_[s]; 857 const vector<Weight> &distance_; // shortest distance to state member in class:fst::PruneQueue
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
shortest-distance.h | 65 : fst_(fst.Copy()), distance_(distance), state_queue_(opts.state_queue), 68 distance_->clear(); 79 vector<Weight> *distance_; member in class:fst::ShortestDistanceState 87 vector<StateId> sources_; // Source state for ith state in 'distance_', 106 distance_->clear(); 114 while ((StateId)distance_->size() <= source) { 115 distance_->push_back(Weight::Zero()); 124 (*distance_)[source] = Weight::One(); 133 while ((StateId)distance_->size() <= s) { 134 distance_->push_back(Weight::Zero()) [all...] |
shortest-path.h | 176 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {} 181 Weight wx = Times(distance_[px.first], px.second); 182 Weight wy = Times(distance_[py.first], py.second); 197 const vector<Weight> &distance_; member in class:fst::ShortestPathCompare
|
rmepsilon.h | 65 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true) { 117 vector<Weight> *distance_; member in class:fst::RmEpsilonState 155 arc.weight = Times((*distance_)[state], arc.weight); 182 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state))); 336 &distance_, 400 vector<Weight> distance_; member in class:fst::RmEpsilonFstImpl
|
/external/chromium/chrome/browser/resources/ntp/ |
drag_drop_controller.js | 73 distance_: function(p1, p2) { 125 if (this.distance_(this.startMouseXY_, this.mouseXY_) >= DRAG_THRESHOLD)
|
/external/openfst/src/include/fst/extensions/pdt/ |
expand.h | 359 queue_(state_table_, stack_, stack_length_, distance_, fdistance_) { 397 distance_(d), fdistance_(fd) {} 408 Weight w1 = (s1 < distance_.size()) && (s1 < fdistance_.size()) ? 409 Times(distance_[s1], fdistance_[s1]) : Weight::Zero(); 410 Weight w2 = (s2 < distance_.size()) && (s2 < fdistance_.size()) ? 411 Times(distance_[s2], fdistance_[s2]) : Weight::Zero(); 426 const vector<Weight> &distance_; member in class:fst::PrunedExpand::StackCompare 471 vector<Weight> distance_; // Distance from initial state in efst_/ofst member in class:fst::PrunedExpand 573 return s < distance_.size() ? distance_[s] : Weight::Zero() [all...] |