| /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...] |
| 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
|
| 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
|
| /external/openfst/src/include/fst/ |
| shortest-distance.h | 81 : fst_(fst), distance_(distance), state_queue_(opts.state_queue),
85 distance_->clear();
96 vector<Weight> *distance_; member in class:fst::ShortestDistanceState
105 vector<StateId> sources_; // Source ID for ith state in 'distance_',
140 distance_->clear();
148 while (distance_->size() <= source) {
149 distance_->push_back(Weight::Zero());
158 (*distance_)[source] = Weight::One();
167 while (distance_->size() <= s) {
168 distance_->push_back(Weight::Zero())
[all...] |
| rmepsilon.h | 80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true),
135 vector<Weight> *distance_; member in class:fst::RmEpsilonState
182 arc.weight = Times((*distance_)[state], arc.weight);
209 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state)));
406 &distance_,
421 &distance_,
495 vector<Weight> distance_; member in class:fst::RmEpsilonFstImpl
|
| shortest-path.h | 217 : pairs_(pairs), distance_(distance), superfinal_(sfinal), delta_(d) {}
223 px.first < distance_.size() ? distance_[px.first] : Weight::Zero();
225 py.first < distance_.size() ? distance_[py.first] : Weight::Zero();
242 const vector<Weight> &distance_;
|
| queue.h | 810 distance_(distance),
824 if (less_(distance_[s], class_distance_[c]))
825 class_distance_[c] = distance_[s];
829 if (less_(distance_[s], limit))
837 if (less_(distance_[s], class_distance_[c]))
838 class_distance_[c] = distance_[s];
856 const vector<Weight> &distance_; // shortest distance to state member in class:fst::PruneQueue
|
| /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...] |
| /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)
|
