| /external/openfst/src/include/fst/ |
| prune.h | 79 return less_(wx, wy);
85 NaturalLess<Weight> less_; member in class:fst::PruneCompare
|
| queue.h | 283 : weights_(weights), less_(less) {}
286 return less_(weights_[x], weights_[y]);
291 L less_; member in class:fst::StateWeightCompare
304 ShortestFirstQueue<S, C>(C(distance, less_)) {}
307 NaturalLess<W> less_; member in class:fst::NaturalShortestFirstQueue
754 : weights_(weights), less_(less), estimate_(estimate) {}
759 return less_(wx, wy);
764 L less_; member in class:fst::AStarWeightCompare
779 ShortestFirstQueue<S, C>(C(distance, less_, estimate)) {}
782 NaturalLess<W> less_; member in class:fst::NaturalAStarQueue
859 L less_; member in class:fst::PruneQueue
884 NaturalLess<W> less_; member in class:fst::NaturalPruneQueue
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| shortest-path.h | 185 // ApproxEqual(a, c) for all c s.t. less_(a, c) && less_(c, b).
187 return less_(wy, wx) || ApproxEqual(wx, wy, delta_);
189 return less_(wy, wx) && !ApproxEqual(wx, wy, delta_);
191 return less_(wy, wx);
200 NaturalLess<Weight> less_; member in class:fst::ShortestPathCompare
|
| queue.h | 251 : weights_(weights), less_(less) {}
254 return less_((*weights_)[x], (*weights_)[y]);
259 L less_; member in class:fst::StateWeightCompare
272 ShortestFirstQueue<S, C>(C(distance, less_)) {}
275 NaturalLess<W> less_; member in class:fst::NaturalShortestFirstQueue
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| expand.h | 412 return less_(w1, w2);
428 NaturalLess<Weight> less_; member in class:fst::PrunedExpand::StackCompare
507 NaturalLess<Weight> less_; member in class:fst::PrunedExpand
633 if (less_(nd, Distance(arc.nextstate))) {
637 if (less_(fd, FinalDistance(arc.nextstate)))
683 return less_(limit_, w);
717 if ((final == Weight::Zero()) || less_(limit_, Times(Distance(s), final)))
799 if(less_(nd, Distance(arc.nextstate)))
804 if (less_(fd, FinalDistance(arc.nextstate)))
817 if (less_(limit_, w)
[all...] |
