| /frameworks/base/media/mca/filterfw/native/core/ |
| geometry.cpp | 40 float Point::Distance(const Point& p0, const Point& p1) {
|
| /frameworks/base/media/mca/filterpacks/native/base/ |
| geometry.cpp | 39 float Point::Distance(const Point& p0, const Point& p1) {
|
| /external/skia/include/core/ |
| SkPoint.h | 210 /** Return the euclidian distance from (0,0) to the point
395 /** Returns the euclidian distance from (0,0) to (x,y)
410 /** Returns the euclidian distance between a and b
412 static SkScalar Distance(const SkPoint& a, const SkPoint& b) {
457 * Returns the squared distance to the infinite line between two pts. Also
466 * Returns the distance to the infinite line between two pts. Also
477 * Returns the squared distance to the line segment between pts a and b
483 * Returns the distance to the line segment between pts a and b.
|
| /external/skia/legacy/include/core/ |
| SkPoint.h | 207 /** Return the euclidian distance from (0,0) to the point
342 /** Returns the euclidian distance from (0,0) to (x,y)
357 /** Returns the euclidian distance between a and b
359 static SkScalar Distance(const SkPoint& a, const SkPoint& b) {
404 * Returns the squared distance to the infinite line between two pts. Also
413 * Returns the distance to the infinite line between two pts. Also
424 * Returns the squared distance to the line segment between pts a and b
430 * Returns the distance to the line segment between pts a and b.
|
| /external/llvm/utils/FileCheck/ |
| FileCheck.cpp | 114 /// matching this pattern at the start of \arg Buffer; a distance of zero
509 // match distance and the number of lines skipped to get to this match.
510 unsigned Distance = ComputeMatchDistance(Buffer.substr(i), VariableTable);
511 double Quality = Distance + (NumLinesForward / 100.);
|
| /external/clang/lib/Basic/ |
| DiagnosticIDs.cpp | 594 unsigned Distance = i->getName().edit_distance(Group, true, BestDistance);
595 if (Distance == BestDistance) {
596 // Two matches with the same distance, don't prefer one over the other.
598 } else if (Distance < BestDistance) {
601 BestDistance = Distance;
|
| /external/llvm/include/llvm/Analysis/ |
| DependenceAnalysis.h | 71 /// Dependence::DVEntry - Each level in the distance/direction vector
73 /// perhaps a distance.
88 const SCEV *Distance; // NULL implies no distance available.
90 PeelLast(false), Splitable(false), Distance(NULL) { }
146 /// getDistance - Returns the distance (or NULL) associated with a
215 /// getDistance - Returns the distance (or NULL) associated with a
346 /// 3) Distance - The value d of the dependence distance;
352 enum ConstraintKind { Empty, Point, Distance, Line, Any } Kind
[all...] |
| /external/jhead/ |
| jhead.h | 93 float Distance;
|
| /external/llvm/lib/Support/ |
| CommandLine.cpp | 217 unsigned Distance = StringRef(Name).edit_distance(
219 if (!Best || Distance < BestDistance) {
221 BestDistance = Distance;
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| expand.h | 327 // shortest-distance information computed using a reverse
448 Weight Distance(StateId s) const;
471 vector<Weight> distance_; // Distance from initial state in efst_/ofst
472 vector<Weight> fdistance_; // Distance to final states in efst_/ofst
494 // the shortest-distance from '(s, current_stack_id_)' to the final
551 << reverse_shortest_path_->GetShortestPathData().Distance(s);
552 return reverse_shortest_path_->GetShortestPathData().Distance(s);
570 // Returns the shortest distance from the initial state to 's' in 'ofst_'.
572 typename A::Weight PrunedExpand<A>::Distance(StateId s) const {
576 // Sets the shortest distance from the initial state to 's' in 'ofst_' to 'w'
[all...] |
| shortest-path.h | 51 // tree info 'Distance()', Parent(), and ArcParent() information keyed
57 // (b) the Distance() is from this 'start' state to the search state.
62 // (a) the Distance() is from the Parent() 'start' state to the
113 SearchData() : distance(Weight::Zero()),
118 Weight distance; // Distance to this state from PDT 'start' state member in struct:fst::PdtShortestPathData::SearchData
148 Weight Distance(SearchState s) const {
150 return data->distance;
153 Weight Distance(const ParenSpec &paren) const {
155 return data->distance;
[all...] |
| /external/llvm/lib/Analysis/ |
| DependenceAnalysis.cpp | 244 // Returns the distance (or NULL) associated with a particular level.
247 return DV[Level - 1].Distance;
305 assert((Kind == Line || Kind == Distance) &&
306 "Kind should be Line (or Distance)");
314 assert((Kind == Line || Kind == Distance) &&
315 "Kind should be Line (or Distance)");
323 assert((Kind == Line || Kind == Distance) &&
324 "Kind should be Line (or Distance)");
329 // If constraint is a distance, returns D.
332 assert(Kind == Distance && "Kind should be Distance")
[all...] |
| /external/v8/src/ |
| assembler.h | 83 enum Distance {
126 void link_to(int pos, Distance distance = kFar) {
127 if (distance == kNear) {
|
